A bound on the chromatic number of the square of a planar graph

Journal of Combinatorial Theory. Series B

Volumn 94, Issue 2, 2005, Pages 189-213

  Molloy, Michael ^a   Salavatipour, Mohammad R ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Chromatic number; Distance 2 coloring; Frequency channel assignment; Planar graphs; Square of a graph; Wegner's conjecture

Indexed keywords

EID: 20444424483     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2004.12.005     Document Type: Article

References (23)

1. G. Agnarsson, M.M. Halldórsson, Coloring powers of planar graphs, SIAM J. Discrete Math. 16 (4) (2003) 651-662.
2. K. Appel W. Haken Every planar map is four colourable Contemp. Math. 98 1989
3. H.L. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen, Approximations for λ -coloring of graphs, Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1770, 2000.
4. O. Borodin, H.J. Broersma, A. Glebov, J. van den Heuvel, Stars and bunches in planar graphs. Part I: Triangulations, CDAM Research Report Series 2002-04, 2002.
5. O. Borodin, H.J. Broersma, A. Glebov, J. van den Heuvel, Stars and bunches in planar graphs. Part II: General planar graphs and colourings, CDAM Research Report Series 2002-05, 2002.
6. J. Chang Kuo The L(2,1)-labeling problem on graphs. SIAM J. Discrete Math. 9 1996 309-316
7. D.A. Fotakis S.E. Nikoletseas V.G. Papadopoulou P.G. Spirakis Hardness results and efficient approximations for frequency assignment problems: Radio labeling and radio coloring J. Comput. Artif. Intell. 20 2 2001 121-180
8. J.P. Georges D.W. Mauro Generalized vertex labeling with a condition at distance two. Congr. Numer. 109 1995 141-159
9. J.P. Georges D.W. Mauro On the size of graphs labeled with a condition at distance two J. Graph Theory 22 1996 47-57
10. j -numbers of the products of complete graphs Congr. Numer. 140 1999 141-160
11. J.R. Griggs R.K. Yeh Labeling graphs with a condition at distance 2 SIAM J. Discrete Math. 5 1992 586-595
12. W.K. Hale Frequency assignment: Theory and application. Proc. IEEE 68 1980 1497-1514
13. T.K. Jonas, Graph coloring analogues with a condition at distance two: L(2,1)-labelings and list λ -labelings, Ph.D. Thesis, University of South Carolina, 1993.
14. T.R. Jensen B. Toft Graph Coloring Problems 1995 Wiley New York
15. S. Ramanathan E.L. Lloyd On the complexity of distance-2 coloring in Proceedings of the Fourth International Conference, Computers and Information 1992 71-74
16. S. Ramanathan E.L. Lloyd Scheduling algorithms for multi-hop radio networks IEEE/ACM Trans. Networking 1 2 1993 166-172
17. D.P. Sanders Y. Zhao A new bound on the cyclic chromatic number J. Combin. Theory B 83 2001 102-111
18. C. Thomassen, Applications of Tutte cycles, Technical Report, Department of Mathematics, Technical University of Denmark, September 2001.
19. J. van den Heuvel R.A. Leese M.A. Shepherd Graph labeling and radio channel assignment J. Graph Theory 29 1998 263-283
20. J. van den Heuvel S. McGuinness Colouring the square of a planar graph J. Graph Theory 42 2003 110-124
21. G. Wegner, Graphs with given diameter and a coloring problem, Technical Report, University of Dortmond, 1977.
22. n and related graphs SIAM J. Disc. Math. 8 1995 499-506
23. S.A. Wong, Colouring graphs with respect to distance, M.Sc. Thesis, Department of Combinatorics and Optimization, University of Waterloo, 1996.