Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T03:33:33.364Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  12 September 2008

Tomaž Slivnik
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, UK

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable