The 4-Choosability of Plane Graphs without 4-Cycles

Journal of Combinatorial Theory. Series B

Volumn 76, Issue 1, 1999, Pages 117-126

  Che Bor Lam, Peter ^a   Xu, Baogang ^b   Liu, Jiazhuang ^b  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^b SHANDONG UNIVERSITY   (China)

Author keywords

4 cycle; Choosability; List coloring; Plane graph

Indexed keywords

EID: 0000582513     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1893     Document Type: Article

References (11)

1. Alon N., Tarsi M. Colorings and orientations of graphs. Combinatorica. 12:1992;125-134.
2. Borodin O. V. Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J. Graph Theory. 12:1996;183-186.
3. Bondy J. A., Murty U. R. S. Graph Theory with Applications. 1976;Macmillan, London.
4. Erdos P., Rubin A. L., Taylor H. Choosability in graphs. Congr. Numer. 26:1979;125-157.
5. Steinberg R. The state of the three color problem. Quo Vadis: Graph Theory? Ann. Discrete Math. 55:1993;North-Holland, Amsterdam. p. 211-248.
6. Thomassen C. Every planar graph is 5-choosable. J. Combin. Theory Ser. B. 62:1994;180-181.
7. Thomassen C. 3-list-coloring planar graphs of girth 5. J. Combin. Theory Ser. B. 64:1995;101-107.
8. Vizing V. G. Vertex coloring with given colors. Diskret. Anal. 29:1976;3-10.
9. Voigt M. List colouring of planar graphs. Discrete Math. 120:1993;215-219.
10. Voigt M. A not 3-choosable planar graph without 3-cycles. Discrete Math. 146:1995;325-328.
11. Voigt M., Wirth B. On 3-colorable non-4-choosable planar graphs. J. Graph Theory. 24:1997;233-235.