Partial list colorings

Discrete Mathematics

Volumn 214, Issue 1-3, 2000, Pages 235-240

  Albertson, Michael O ^a   Grossman, Sara ^a   Haas, Ruth ^a  

^a SMITH COLLEGE   (United States)

Author keywords

Choice number; Chromatic number; Graph coloring; List coloring

Indexed keywords

EID: 0009804801     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00315-5     Document Type: Article

References (9)

1. M.O. Albertson, D.M. Berman, The chromatic difference sequence of a graph, J. Combin. Theory Ser. B 29 (1980) 1-12.
2. M.O. Albertson, D.M. Berman, A conjecture on planar graphs, Graph Theory and Related Topics, Academic Press, New York, 1979, p. 357.
3. O.V. Borodin, On acyclic colorings of planar graphs, Discrete Math. 25 (1979) 211-236.
4. G.G. Chappell, A lower bound for partial list colorings, preprint, 1998.
5. P. Erdos, Graph theory and probability, Canad. J. Math. 11 (1959) 34-38.
6. P. Erdos, A. Rubin, H. Taylor, Choosability in graphs, Congr. Numer. 26 (1979) 125-157.
7. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
8. Maryam 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.