Abstract
Let G be a graph and H a subgraph of G. A backbone-k-coloring of (G,H) is a mapping f: V(G)→{1,2,…,k} such that |f(u)−f(v)|≥2 if uv∈E(H) and |f(u)−f(v)|≥1 if uv∈E(G)\E(H). The backbone chromatic number of (G,H) is the smallest integer k such that (G,H) has a backbone-k-coloring. In this paper, we characterize the backbone chromatic number of Halin graphs G=T∪C with respect to given spanning trees T. Also we study the backbone coloring for other special graphs such as complete graphs, wheels, graphs with small maximum average degree, graphs with maximum degree 3, etc.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Appel K, Haken W (1976) Every planar map is four colorable. Bull Am Math Soc 82:711–712
Bondy JA, Lovász L (1985) Length of cycles in Halin graphs. J Graph Theory 8:397–410
Broersma HJ, Fomin FV, Golovach PA, Woeginger GJ (2007) Backbone colorings for graphs: trees and path backones. J Graph Theory 55:137–152
Broersma HJ, Fujisawa J, Marchal L, Paulusma D, Salman ANM, Yoshimoto K (2009a) λ-Backbone colorings along pairwise disjoint stars and matchings. Discrete Math 309:5596–5609
Broersma HJ, Marchal L, Paulusma D, Salman ANM (2009b) Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discuss Math Graph Theory 29:143–162
Chang GJ, Kuo D (1996) The L(2,1)-labelling problem on graphs. SIAM J Discrete Math 9:309–316
Chen M, Wang W (2006) The 2-dipath chromatic number of Halin graphs. Inf Process Lett 99:47–53
Erdős P, Rubin AL, Taylor H (1979) Choosability in graphs. Congr Numer 26:125–157
Georges JP, Mauro DW, Stein MI (2000) Labeling products of complete graphs with a condition at distance two. SIAM J Discrete Math 14:28–35
Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discrete Math 5:586–595
Grötzsch H (1959) Ein Drefarbensatz fur dreikreisfreie Netze auf der Kugel. Wiss Z Martin-Luther-Univ Halle-Wittenberg, Mat-Natur Reche 8:109–120
Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68:1497–1514
Halin R (1971) Studies on minimally n-connected graphs. In: Combinatorial mathematics and its applications. Proc conf Oxford, 1969. Academic Press, London, pp 129–136
Lam PCB, Zhang Z (1997) The vertex-face total chromatic number of Halin graphs. Networks 30:167–170
Mis̆kuf J, S̆krekovski R, Tancer M (2008) Backbone colorings and generalized Mycielski graphs. SIAM J Discrete Math 23:1063–1070
Mis̆kuf J, S̆krekovski R, Tancer M (2010) Backbone colorings of graphs with bounded degree. Dsicrete Appl Math 158:534–542
Molloy M, Salavatipour MR (2005) A bound on the chromatic number of the square of a planar graph. J Comb Theory Ser B 94:189–213
Montassier M, Raspaud A (2006) (d,1)-Total labeling of graphs with a given maximum average degree. J Graph Theory 51:93–109
Sakai D (1994) Labelling chordal graphs: distance two condition. SIAM J Discrete Math 7:133–140
Stadler PF (2003) Minimum cycle bases of Halin graphs. J Graph Theory 43:150–155
Wang W (2006) The L(2,1)-labelling of trees. Discrete Appl Math 154:598–603
Wang W, Lih K-W (2005) List coloring Halin graphs. Ars Comb 77:53–63
Wang W, Lih K-W (2004) Labelling planar graphs with conditions on girth and distance two. SIAM J Discrete Math 17:264–275
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported partially by the French-China collaboration research program (PRA No. 15671RF or SI-0706), NSFC (No. 10771197, 10971198) and ZJNSF (No. Z6090150).
Rights and permissions
About this article
Cite this article
Wang, W., Bu, Y., Montassier, M. et al. On backbone coloring of graphs. J Comb Optim 23, 79–93 (2012). https://doi.org/10.1007/s10878-010-9342-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9342-6