A note on planar 5-list colouring: Non-extendability at distance 4

Discrete Mathematics

Volumn 251, Issue 1-3, 2002, Pages 169-172

  Tuza, Zs ^a,b   Voigt, M ^c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY OF PANNONIA   (Hungary)

^c ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Distance; Graph; List colouring; Planar

Indexed keywords

EID: 33750699684     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00338-7     Document Type: Article

References (13)

1. M.O. Albertson, You can't paint yourself into a corner, J. Combin. Theory Ser. B 73 (1998) 189-194.
2. M.O. Albertson, E.H. Moore, Extending graph colorings, J. Combin. Theory Ser. B 77 (1999) 83-95.
3. M. Birô, M. Hujter, Zs. Tuza, Precoloring extension. I. Interval graphs, Discrete Math. 100 (1992) 267-279.
4. Sh. Gutner, The complexity of planar graph choosability, Manuscript, 1994, Discrete Math. 159 (1996) 119-130.
5. M. Hujter, Zs. Tuza, Precoloring extension. II. Graph classes related to bipartite graphs, Acta Math. Univ. Comenian. 62 (1993) 1-11.
6. M. Hujter, Zs. Tuza, Precoloring extension. III. Classes of perfect graphs, Combinatorics, Probab. Comput. 5 (1996) 35-56.
7. M. Hujter, Zs. Tuza, Precoloring extension. IV. General bounds and list colourings, in preparation.
8. M. Mirzakhani, A small non-4-choosable planar graph, Bull. Inst. Combin. Appl. 17 (1996) 15-18.
9. C. Thomassen, Every planar graph is 5-choosable, J. Combin. Theory Ser. B 62 (1994) 180-181.
10. C. Thomassen, Color-critical graphs on a fixed surface, J. Combin. Theory Ser. B 70 (1997) 67-100.
11. Zs. Tuza, Graph colorings with local constraints-a survey, Discuss. Math.-Graph Theory 17 (1997) 161-228.
12. M. Voigt, List colorings of planar graphs, Discrete Math. 120 (1993) 215-219.
13. M. Voigt, B. Wirth, On 3-colorable non-4-choosable planar graphs, J. Graph Theory 24 (1997) 233-235.