Coloring squares of planar graphs with girth six

European Journal of Combinatorics

Volumn 29, Issue 4, 2008, Pages 838-849

  Dvořák, Zdeněk ^a   Král', Daniel ^a   Nejedlý, Pavel ^a   Škrekovski, Riste ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41549120956     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.11.005     Document Type: Article

References (21)

1. Agnarsson G., and Halldórsson M.M. Coloring powers of planar graphs. Proc. SODA'00 (2000), SIAM press 654-662
2. Agnarsson G., and Halldórsson M.M. Coloring powers of planar graphs. SIAM J. Discrete Math. 16 4 (2003) 651-662
3. Alon N., and Mohar B. The chromatic number of graph powers. Combin. Probab. Comput. 11 (2002) 1-10
4. O.V. 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 2002-05, 2002
5. Borodin O.V., Glebow A.N., Ivanova A.O., Neustroeva T.K., and Taskinov V.A. Sufficient conditions for planar graphs to be 2-distance (Δ + 1)-colorable. Sib. Elektron. Mat. Izv. 1 (2004) 129-141 (in Russian)
6. Borodin O.V., Ivanova A.O., and Neustroeva T.K. 2-distance coloring of sparse planar graphs. Sib. Elektron. Mat. Izv. 1 (2004) 76-90 (in Russian)
7. Borodin O.V., Ivanova A.O., and Neustroeva T.K. Conditions for planar graphs of girth 6 to be 2-distance (Δ + 1)-colourable. Diskretn. Anal. Issled. Oper. 12 (2005) 32-47 (in Russian)
8. Erdo{double acute}s P., Rubin A.L., and Taylor H. Choosability in graphs. Congr. Numer. 26 (1980) 122-157
9. van den Heuvel J., and McGuiness S. Colouring of the square of a planar graph. J. Graph Theory 42 (2003) 110-124
10. Jendrol' S., and Skupien Z. Local structures in plane maps and distance colourings. Discrete Math. 236 (2001) 167-177
11. S. Jendrol', H.-J. Voss, Light subgraphs of graphs embedded in the plane and in the projective plane-a survey, IM Preprint series A, No. 1/2004, Pavol Jozef Šafárik University, Slovakia, 2004
12. Jensen T.R., and Toft B. Graph Coloring Problems (1995), John-Wiley and Sons, New York
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, SC, 1993
14. K.-W. Lih, W.-F. Wang, Coloring the square of an outerplanar graph, Technical Report, Academia Sinica, Taiwan, 2002
15. Madaras T., and Marcinová A. On the structural result on normal plane maps. Discuss. Math. Graph Theory 22 (2002) 293-303
16. Molloy M., and Salavatipour M.R. A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B 94 (2005) 189-213
17. Molloy M., and Salavatipour M.R. Frequency channel assignment on planar networks. In: Möhring R.H., and Raman R. (Eds). Proc. ESA'02. LNCS vol. 2461 (2002), Springer 736-747
18. Vizing V.G. Colouring the vertices of a graph in prescribed colours. Diskret. Anal. 29 (1976) 3-10 (in Russian)
19. Wang W.-F., and Lih K.-W. Labeling planar graphs with conditions on girth and distance two. SIAM J. Discrete Math. 17 2 (2003) 264-275
20. G. Wegner, Graphs with given diameter and a coloring problem, Technical Report, University of Dortmund, Germany, 1977
21. S.A. Wong, Colouring graphs with respect to distance, M.Sc. Thesis, University of Waterloo, Canada, 1996