Planar graphs without cycles of specific lengths

European Journal of Combinatorics

Volumn 23, Issue 4, 2002, Pages 377-388

  Fijavz G ^a   Juvan, M ^a   Mohar, B ^a   Skrekovski R ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036322849     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2002.0570     Document Type: Article

References (13)

1. N. Alon, Restricted colorings of graphs, in: Surveys in Combinatorics, London Mathematical Society Lecture Note Series 187, K. Walker (ed.), Cambridge University Press, Cambridge, 1993, pp. 1-33.
2. S. Gutner, The complexity of planar graph choosability, Discrete Math., 159 (1996), 119-130.
3. T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley Interscience, New York, 1995.
4. J. Kratochvíl, Z. Tuza and M. Voigt, New trends in the theory of graph colorings: choosability and list coloring Contemporary Trends in Discrete Mathematics Štiřin Castle, 1997, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 49, American Mathematical Society, Providence, RI, 1999, pp. 183-197.
5. P. B. C. Lam, B. Xu and J. Liu, The 4-choosability of plane graphs without 4-cycles, J. Comb. Theory Ser. B, 76 (1999), 117-126.
6. M. Mirzakhani, A small non-4-choosable planar graph, Bull. Inst. Comb. Appl., 17 (1996), 15-18.
7. C. Thomassen, Every planar graph is 5-choosable, J. Comb. Theory Ser. B, 62 (1994a), 180-181.
8. C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Comb. Theory Ser. B, 64 (1994b), 101-107.
9. Z. Tuza, Graph colorings with local constraints - a survey, Discuss. Math. Graph Theory, 17 (1997), 161-228.
10. M. Voigt, List colourings of planar graphs, Discrete Math., 120 (1993), 215-219.
11. M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math., 146 (1995), 325-328.
12. W. Weifan and K. -W. Lih, Choosability and edge choosability of planar graphs without 5- cycles, Appl. Math. Lett., to appear
13. W. Weifan and K. -W. Lih, Structural properties and edge choosability of plane graphs without 6-cycles, Comb. Probab. Comput., 10 (2001), 267-276.