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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have