Coloring the square of a K4-minor free graph

Discrete Mathematics

Volumn 269, Issue 1-3, 2003, Pages 303-309

  Lih, Ko Wei ^a   Wang, Wei Fan ^b   Zhu, Xuding ^c  

^a INSTITUTE OF MATHEMATICS   (Taiwan)

^b ZHEJIANG NORMAL UNIVERSITY   (China)

^c NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Chromatic number; K4 minor free graph; Series parallel graph; Square

Indexed keywords

SET THEORY; THEOREM PROVING;

SERIES-PARALLEL GRAPHS;

GRAPH THEORY;

EID: 0038141199     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00059-1     Document Type: Article

References (9)

1. G. Agnarsson, M.M. Halldórsson, Coloring powers of planar graphs, SIAM J. Discrete Math. 2000, submitted for publication.
2. 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, London School of Economics and Political Science, 2002. A translated and adapted version of a paper that appeared in Diskretn. Anal. Issled. Oper. Ser. 1 8 (2001) 9-33 (in Russian).
3. Chartrand G., Harary F. Planar permutation graphs. Ann. Inst. H. Poincaré Sect. B (N.S.). 3:1967;433-438.
4. Duffin R.J. Topology of series-parallel networks. J. Math. Anal. Appl. 10:1965;303-318.
5. M. Molloy and M.R. Salavatipour, A bound on the chromatic number of the square of a graph, preprint, 2002.
6. C. Thomassen, Applications of Tutte cycles, Technical Report, Technical University of Denmark, 2001.
7. van den Heuvel J., McGuinness S. Coloring the square of a planar graph. J. Graph Theory. 42:2003;110-124.
8. G. Wegner, Graphs with given diameter and a coloring problem, Technical Report, University of Dortmund, 1977.
9. Wei-Fan Wang, Ko-Wei Lih, Labeling planar graphs with conditions on girth and distance two, SIAM J. Discrete Math., to appear.