Edge-choosability of multicircuits

Discrete Mathematics

Volumn 202, Issue 1-3, 1999, Pages 271-277

  Woodall, Douglas R ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Chromatic index; Edge colouring; Edge choosability; List chromatic index; List colouring conjecture; Multicircuit

Indexed keywords

EID: 0042205998     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00297-0     Document Type: Article

References (7)

1. O.V. Borodin, A.V. Kostochka, D.R. Woodall, List edge and list total colourings of multigraphs, J. Combin. Theory Ser. B 71 (1997) 184-204.
2. O.V. Borodin, A.V. Kostochka, D.R. Woodall, On kernel-perfect orientiations of line graphs, Discrete Math., to appear.
3. F. Galvin, The list chromatic index of a bipartite multigraph, J. Combin. Theory Ser. B 63 (1995) 153-158.
4. R. Häggkvist, A. Chetwynd, Some upper bounds on the total and list chromatic numbers of multigraphs, J. Graph Theory 16 (1992) 503-516.
5. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, New York, 1995.
6. F. Maffray, Kernels in perfect line-graphs, J. Combin. Theory Ser. B 55 (1992) 1-8.
7. D. Peterson, D.R. Woodall, Edge-choosability in line-perfect multigraphs, Discrete Math. 202 (this Vol.) (1999) 191-199.