The complexity of planar graph choosability

Discrete Mathematics

Volumn 159, Issue 1-3, 1996, Pages 119-130

  Gutner, Shai ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000027149     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00104-5     Document Type: Article

References (13)

1. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992) 125-134.
2. P. Erdos, A.L. Rubin and H. Taylor, Choosability in graphs, in: Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congr. Numer. XXVI (1979) 125-157.
3. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (W.H. Freeman and Company, New York, 1979).
4. S. Gutner and M. Tarsi, Some results on (a : b)-choosability, submitted.
5. J. Kratochvil and Zs. Tuza, Algorithmic complexity of list colorings, Discrete Appl. Math. in press.
6. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.
7. M. Middendorf and F. Pfeiffer, On the complexity of the disjoint paths problem, Combinatorica 13 (1993) 97-107.
8. M. Stiebitz, private communication.
9. C. Thomassen, Every planar graph is 5-choosable, Technical Report, The Technical University of Denmark, 1993.
10. C. Thomassen, 3-list-coloring planar graphs of girth 5, Technical Report, The Technical University of Denmark, February 1994.
11. V.G. Vizing, Coloring the vertices of a graph in prescribed colors (in Russian), Diskret. Analiz. No. 29, Metody Diskret. Anal. v. Teorii Kodov i Shem 101 (1976) 3-10.
12. M. Voigt, List colourings of planar graphs, Discrete Math. 120 (1993) 215-219.
13. M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math., in press.