List Improper Colourings of Planar Graphs

Combinatorics Probability and Computing

Volumn 8, Issue 3, 1999, Pages 293-299

  Skrekovski R ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033467290     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399003752     Document Type: Article

References (18)

1. Borowiecki, M., Drgas-Burchardt, E. and Mihók, P. (1995) Generalized list colorings of graphs. Discuss. Math. Graph Theory 15 185-193.
2. Borowiecki, M., Broere, I. and Mihók, P. (1997) On generalized list colourings of graphs. Discuss. Math. Graph Theory 17 123-132.
3. Cowen, L. J., Cowen, R. H. and Woodall, D. R. (1986) Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10 187-195.
4. Cowen, L. J., Goddard, W. and Jesurum, C. E. (1997) Defective colorings revisited. J. Graph Theory 24 205-219.
5. Erdos, P., Rubin, A. L. and Taylor H. (1979) Choosability in graphs. Congr. Numer. 26 125-157.
6. Frick, M. (1993) A survey of (m,k)-colorings. In Quo Vadis, Graph Theory? (J. Gimbel, J. W. Kennedy and L. V. Quintas, eds), Ann. Discrete Math. 55 45-48.
7. Gutner, S. (1996) The complexity of planar graph choosability. Discrete Math. 159 119-130.
8. Jensen, T. R. and Toft, B. (1995) Graph Coloring Problems, Wiley Interscience, New York.
9. Kratochvíl, J. and Tuza, Z. (1994) Algorithmic complexity of list colorings. Discrete Appl. Math. 50 297-302.
10. Mirzakhani, M. (1996) A small non-4-choosable planar graph. Bull. Inst. Combin. Appl. 17 15-18.
11. Thomassen, C. (1994) Every planar graph is 5-choosable. J. Combin. Theory Ser. B 62 180-181.
12. Thomassen, C. (1994) 3-list-coloring planar graphs of girth 5. J. Combin. Theory Ser. B 64 101-107.
13. Škrekovski, R. A Grötzsch-type theorem for list colourings with impropriety one. To appear in Combinatorics, Probability and Computing.
14. Vizing, V. G. (1976) Coloring the vertices of a graph in prescribed colors. Metody Diskret. Analiz. 29 3-10. (In Russian.)
15. Voigt, M. (1993) List colourings of planar graphs. Discrete Math. 120 215-219.
16. Voigt, M. (1995) A not 3-choosable planar graph without 3-cycles. Discrete Math. 146 325-328.
17. Voigt, M. and Wirth, B. (1997) On 3-colorable non 4-choosable planar graphs. J. Graph Theory 24 233-235.
18. Woodall, D. R. (1990) Improper colourings of graphs. In Graph Colourings (R. Nelson and R. J. Wilson, eds), Longman Scientific and Technical.