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

DOI10.1017/S0963548300001851zbMath0857.05034OpenAlexW2154969651MaRDI QIDQ4883064

Tomaž Slivnik

Publication date: 6 March 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001851

zbMATH Keywords

chromatic indexbipartite multigraphGalvin's theoremlist chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Hownotto prove the Alon-Tarsi conjecture ⋮ Hall parameters of complete and complete bipartite graphs ⋮ List edge and list total colourings of multigraphs ⋮ A vertex-splitting lemma, de Werra's theorem and improper list colourings ⋮ Edge-coloring almost bipartite multigraphs ⋮ Completing Partial Schedules for Open Shop with Unit Processing Times and Routing ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof

Cites Work

• Kernels in perfect line-graphs
• List-colourings of graphs
• A new upper bound for the list chromatic number
• Colorings and orientations of graphs
• The list chromatic index of a bipartite multigraph
• A note on list-colorings
• Using euler partitions to edge color bipartite multigraphs
• The Dinitz problem solved for rectangles
• College Admissions and the Stability of Marriage

This page was built for publication: Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph