论文信息 - Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph - 字舞流文

Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph

Recently, Galvin [7] proved that every k -edge-colourable bipartite multigraph is k -edge-choosable. In particular, for a bipartite multigraph G , . Here we give a brief self-contained proof of this result.

Tomaz Slivnik | Tomaz Slivnik

[1] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .

[2] Roland Häggkvist,et al. New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs , 1997, Combinatorics, Probability and Computing.

[3] Béla Bollobás,et al. A new upper bound for the list chromatic number , 1989, Discret. Math..

[4] Roland Häggkvist,et al. A note on list-colorings , 1989, J. Graph Theory.

[5] Béla Bollobás,et al. List-colourings of graphs , 1985, Graphs Comb..

[6] Frédéric Maffray,et al. Kernels in perfect line-graphs , 1992, J. Comb. Theory, Ser. B.

[7] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..

[8] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.

[9] Jeannette C. M. Janssen. The Dinitz problem solved for rectangles , 1993 .