Short proof of Galvin's theorem on the list-chromatic index of a bipartite multigraph

Combinatorics Probability and Computing

Volumn 5, Issue 1, 1996, Pages 91-94

  Slivnik, Tomaž ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030560167     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300001851     Document Type: Article

References (16)

1. Alon, N. and Tarsi, M. (1992) Colorings and orientations of graphs. Combinatorica 12 (2) 125-134.
2. Bollobás, B. and Harris, A. J. (1985) List-colourings of graphs. Graphs and Combinatorics 1 115-127.
3. Bollobás, B. and Hind, H. R. (1989) A new upper bound for the list chromatic number. Discrete Mathematics 74 65-75.
4. Chetwynd, A. and Häggkvist, R. (1989) A note on list-colorings. J. Graph Theory 13 87-95.
5. Erdos, P., Rubin, A. L. and Taylor, H. (1980) Choosability in graphs. Congressus Numerantium 26 125-157.
6. Gabow, H. N. (1976) Using Euler partitions to edge colour bipartite multigraphs. Int. J. Comput. Infor. Sci. 5 345-355.
7. Galvin, F. (1995) The list chromatic index of a bipartite multigraph. J. Combinatorial Theory Series B 63 153-158.
8. Gale, D. and Shapley, L. S. (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69 9-15.
9. Häggkvist, R. and Janssen, J. (1993) On the list-chromatic index of bipartite graphs. Research Report No. 15, Department of Mathematics, University of Umeå.
10. Häggkvist, R. and Janssen, J. (1993) New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. Research Report No. 19, Department of Mathematics, University of Umeå.
11. Harris, A. J. (1985) Problems and conjectures in extremal graph theory. PhD dissertation, Cambridge.
12. Janssen, J. C. M. (1993) Even and odd latin squares. PhD dissertation, Lehigh University.
13. Janssen, J. C. M. (1993) The Dinitz problem solved for rectangles. Bull. Amer. Math. Soc. (New Series) 29 243-249.
14. Kahn, J. (to appear) Asymptotically good list-colorings. J. Combinatorial Theory, Series A.
15. Maffray, F. (1992) Kernels in perfect line-graphs. J. Combinatorial Theory, Series B 55 1-8.
16. Vizing, V. G. (1992) Colouring the vertices of a graph in prescribed colours (in Russian). Diskret. Analiz. 29 3-10.