Backbone colorings for graphs: Tree and path backbones

Journal of Graph Theory

Volumn 55, Issue 2, 2007, Pages 137-152

  Broersma, Hajo ^a   Fomin, Fedor V ^b   Golovach, Petr A ^c   Woeginger, Gerhard J ^d  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF BERGEN   (Norway)

^c SYKTYVKAR STATE UNIVERSITY   (Russian Federation)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Computational complexity; Graph coloring; Graph labeling; Planar graph; Spanning path; Spanning tree

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY;

GRAPH COLORING; GRAPH LABELING; PLANAR GRAPH; SPANNING PATH; SPANNING TREE;

GRAPH THEORY;

EID: 34249826971     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20228     Document Type: Article

References (22)

1. G. Agnarsson and M. M. Halldórsson, Coloring powers of planar graphs, SIAM J Discrete Math 16 (2003), 651-662.
2. H. L. Bodlaender, T. Kloks, R. B. Tan, and J. van Leeuwen, Approximations for λ-colorings of graphs, Computing J 47 (2004), 193-204.
3. O. V. Borodin, H. J. Broersma, A. Glebov, and J. van den Heuvel, Stars and bunches in planar graphs. Part I: Triangulations (Russian), Diskretn Anal Issled Oper Ser 1 8 (2001), 15-39.
4. O. V. Borodin, H. J. Broersma, A. Glebov, and J. van den Heuvel, Stars and bunches in planar graphs. Part II: General planar graphs and colourings (Russian). Diskretn Anal Issled Oper Ser 1 8 (2001), 9-33.
5. H. J. Broersma, F. V. Fomin, P. A. Golovach, and G. J. Woeginger, Backbone colorings for networks, in Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), LNCS 2880 (2003) 131-142.
6. H. J. Broersma, J. Fujisawa, L. Marchal, D. Paulusma, A. N. M. Salman, and K. Yoshimoto, λ-Backbone colorings along pairwise disjoint stars and matchings. Submitted (2006).
7. G. J. Chang and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J Discrete Math 9 (1996), 309-316.
8. J. Fiala, A. V. Fishkin, and F. V. Fomin, Off-line and on-line distance constrained labeling of graphs, Theoret Comput Sci 326 (2004), 261-292.
9. J. Fiala, T. Kloks, and J. Kratochvíl, Fixed-parameter complexity of X-labelings, Discrete Appl Math 113 (2001), 59-72.
10. J. Fiala, J. Kratochvíl, and A. Proskurowski, Systems of distant representatives, Discrete Appl Math 145 (2005), 306-316.
11. D. A. Fotakis, S. E. Nikoletseas, V. G. Papadopoulou, and P. G. Spirakis, Radiocoloring in planar graphs: complexity and approximations, Theoret Comput Sci 340 (2005), 514-538.
12. M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness W.H. Freeman and Company, New York, 1979.
13. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
14. J. R. Griggs and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J Discrete Math 5 (1992), 586-595.
15. W. K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68 (1980), 1497-1514.
16. P. L. Hammer and S. Földes, Split graphs, Congressus Numerantium 19 (1977), 311-315.
17. J. van den Heuvel, R. A. Leese, and M. A. Shepherd, Graph labeling and radio channel assignment, J Graph Theory 29 (1998), 263-283.
18. J. van den Heuvel and S. McGuinness, Colouring the square of a planar graph, J Graph Theory 42 (2003), 110-124.
19. T. K. Jonas, Graph coloring analogues with a condition at distance two: L(2, 1)-labellings and list λ-labellings. Ph.D. Thesis, University of South Carolina, 1993.
20. R. A. Leese, Radio spectrum: a raw material for the telecommunications industry, in Progress in Industrial Mathematics at ECMI98, Teubner, Stuttgart (1999), 382-396.
21. M. Molloy and M. R. Salavatipour, A bound on the chromatic number of the square of a planar graph, J Combin Theory Ser B 94 (2005), 189-213.
22. G. Wegner, Graphs With Given Diameter and a Colouring Problem. Preprint, University of Dortmund, 1977.