Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs

European Journal of Combinatorics

Volumn 22, Issue 1, 2001, Pages 71-78

  Weifan, Wang ^a   Lih, Ko Wei ^b  

^a LIAONING UNIVERSITY   (China)

^b INSTITUTE OF MATHEMATICS   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (20)

1. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica, 12 (1992), 125-134.
2. K. Appel and W. Haken, Every Planar Map is Four Colorable, American Mathematical Society, Providence, RI, 1989.
3. B. Bollobás and A. J. Harris, List-coloring of graphs, Graphs Comb., 1 (1985), 115-127.
4. B. Bollobás and H. R. Hind, A new upper bound for the list chromatic number, Discrete Math., 74 (1989), 65-75.
5. O. V. Borodin and D. R. Woodall, Thirteen colouring numbers for outerplane graphs, Bul. Inst. Combin. and Appl., 14 (1995), 87-100.
6. O. V. Borodin, A. V. Kostochka and D. R. Woodall, List edge and list total coloring of multigraphs, J. Comb. Theory B, 71 (1997), 184-204.
7. M. N. Ellingham and L. Goddyn, List edge colorings of some 1-factorable multigraphs, Combinatorica, 16 (1996), 343-352.
8. P. Erdos, A. L. Rubin and H. Taylor, Choosability in graphs, Congr. Numer., 26 (1979), 125-157.
9. H. Fleischner and M. Stiebitz, A solution to a coloring problem of P. Erdos, Discrete Math., 101 (1992), 39-48.
10. F. Galvin, The list chromatic index of a bipartite multigraph, J. Comb. Theory B, 63 (1995), 153-158.
11. R. Häggkvist and A. Chetwynd, Some upper bounds on the total and list chromatic numbers of multigraphs, J. Graph Theory, 16 (1992), 503-516.
12. R. Häggkvist and J. Janssen, New bounds on the list-chromatic index of the complete graph and other simple graphs, Combin. Probab. Comput., 6 (1997), 295-313.
13. J. Kahn, Asymptotics of the list-chromatic index for multigraphs, Random Struct. Algor., 17 (2000), 117-156.
14. D. Peterson and D. R. Woodall, Edge-choosability in line-perfect multigraphs, Discrete Math., 202 (1999), 191-199.
15. C. Thomassen, Every planar graph is 5-choosable, J. Comb. Theory B, 62 (1994), 180-181.
16. C. Thomassen, 3-list coloring planar graphs of girth 5, J. Comb. Theory B, 64 (1995), 101-107.
17. V. G. Vizing, Vertex colorings with given colors (in Russian), Melody Diskret. Analiz., 29 (1976), 3-10.
18. M. Voigt, List colorings of planar graphs, Discrete Math., 120 (1993), 215-219.
19. D. R. Woodall, Edge-choosability of multicircuits, Discrete Math., 202 (1999), 271-277.
20. Zhang Zhongfu, Zhang Jianxun and Wang Jianfang, The total chromatic number of some graphs, Sci. Sin. A, 31 (1988), 1434-1441.