E-resources
-
Bu, Yuehua; Finbow, Stephen; Liu, Daphne Der-Fen; Zhu, Xuding
Discrete Applied Mathematics, 04/2014, Volume: 167Journal Article
Suppose that G is a graph and that H is a subgraph of G. Let L be a mapping that assigns to each vertex v of G a set L(v) of positive integers. We say that (G,H) is backboneL-colourable if there is a proper vertex colouring c of G such that c(v)∈L(v) for all v∈V, and |c(u)−c(v)|⩾2 for every edge uv in H. We say that (G,H) is backbone k-choosable if (G,H) is backbone L-colourable for any list assignment L with |L(v)|=k for all v∈V(G). The backbone choice number of (G,H), denoted by chBB(G,H), is the minimum k such that (G,H) is backbone k-choosable. The concept of a backbone choice number is a generalization of both the choice number and the L(2,1)-choice number. Precisely, if E(H)=0̸, then chBB(G,H)=ch(G), where ch(G) is the choice number of G; if G=H2, then chBB(G,H) is the same as the L(2,1)-choice number of H. In this article, we first show that, if |L(v)|=dG(v)+2dH(v), then (G,H) is L-colourable, unless E(H)=0̸ and each block of G is a complete graph or an odd cycle. This generalizes a result of Erdős, Rubin, and Taylor on degree-choosable graphs. Second, we prove that chBB(G,H)⩽max{⌊mad(G)⌋+1,⌊mad(G)+2mad(H)⌋}, where mad(G) is the maximum average degree of a graph G. Finally, we establish various upper bounds on chBB(G,H) in terms of ch(G). In particular, we prove that, for a k-choosable graph G, chBB(G,H)⩽3k if every component of H is unicyclic; chBB(G,H)⩽2k if H is a matching; and chBB(G,H)⩽2k+1 if H is a disjoint union of paths with length at most 2.
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.