Note on coloring the square of an outerplanar graph

Ars Combinatoria

Volumn 86, Issue , 2008, Pages 89-95

  Wang, Wei Fan ^a   Lih, Ko Wei ^b  

^a ZHEJIANG NORMAL UNIVERSITY   (China)

^b INSTITUTE OF MATHEMATICS   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40749114301     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. J. van den Heuvel and S. McGuinness, Coloring the square of a planar graph, J. Graph Theory 42 (2003), 110-124.
2. K. W. Lih and W. F. Wang, Coloring the square of an outerplanar graph, to appear in Taiwanese J. Math.
3. 4-minor free graph, Discrete Math. 209 (2003), 303-309.
4. M. Molloy and M.R. Salavatipour, A bound on the chromatic number of the square of a graph, to appear in J. Combin. Theory, Ser. B.
5. C. Thomassen, Applications of Tutte cycles, Technical Report, Technical University of Denmark, 2001.
6. W.F. Wang and K.M. Zhang, Δ-matching and edge-face chromatic number, Acta Math. Appl. Sinica 22 (1999), 236-242.
7. W.F. Wang and K. W. Lih, Labelling planar graphs with conditions on girth and distance two, SIAM J. Discrete Math. 17 (2004), 264-275.
8. G. Wegner, Graphs with given diameter and a coloring problem, preprint, University of Dortmund, 1977.