We continue the study on backbone colorings, a variation on classical vertex colorings that was introduced at WG2003. Given a graph G = (V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring for G and H is a proper vertex coloring V→ {1,2,...} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The algorithmic and combinatorial properties of backbone colorings have been studied for various types of backbones in a number of papers. The main outcome of earlier studies is that the minimum number l of colors, for which such colorings V→ {1,2,...,l} exist, in the worst case is a factor times the chromatic number (for path, tree, matching and star backbones). We show here that for split graphs and matching or star backbones, l is at most a small additive constant (depending on λ) higher than the chromatic number. Our proofs combine algorithmic and combinatorial arguments. We also indicate other graph classes for which our results imply better upper bounds on l than the previously known bounds.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1437,
author = {Hajo Broersma and Bert Marchal and Daniel Paulusma and A.N.M. Salman},
title = {Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number},
journal = {Discussiones Mathematicae Graph Theory},
volume = {29},
year = {2009},
pages = {143-162},
zbl = {1181.05036},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1437}
}
Hajo Broersma; Bert Marchal; Daniel Paulusma; A.N.M. Salman. Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discussiones Mathematicae Graph Theory, Tome 29 (2009) pp. 143-162. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1437/
[000] [1] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, London and Elsevier, New York, 1976). | Zbl 1226.05083
[001] [2] H.J. Broersma, A general framework for coloring problems: old results, new results and open problems, in: Proceedings of IJCCGGT 2003, LNCS 3330 (2005) 65-79. | Zbl 1117.05038
[002] [3] H.J. Broersma, F.V. Fomin, P.A. Golovach and G.J. Woeginger, Backbone colorings for networks, in: Proceedings of WG 2003, LNCS 2880 (2003) 131-142. | Zbl 1255.05076
[003] [4] H.J. Broersma, F.V. Fomin, P.A. Golovach and G.J. Woeginger, Backbone colorings for graphs: tree and path backbones, J. Graph Theory 55 (2007) 137-152, doi: 10.1002/jgt.20228. | Zbl 1118.05031
[004] [5] H.J. Broersma, J. Fujisawa, L. Marchal, D. Paulusma, A.N.M. Salman and K. Yoshimoto, λ-Backbone colorings along pairwise disjoint stars and matchings, preprint (2004). www.durham.ac.uk/daniel.paulusma/Publications/Papers/Submitted/backbone.pdf. | Zbl 1213.05068
[005] [6] H.J. Broersma, L. Marchal, D. Paulusma and A.N.M. Salman, Improved upper bounds for λ-backbone colorings along matchings and stars, in: Proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2007, LNCS 4362 (2007) 188-199. | Zbl 1131.05301
[006] [7] M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980). | Zbl 0541.05054
[007] [8] P.L. Hammer and S. Földes, Split graphs, Congr. Numer. 19 (1977) 311-315.