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

Tomaž Slivnik

Source record

Source: Crossref

Published: Mar 1, 1996

DOI: 10.1017/s0963548300001851

Open original source ↗

Source abstract

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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.