Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
From MaRDI portal
Publication:4883064
DOI10.1017/S0963548300001851zbMATH Open0857.05034OpenAlexW2154969651MaRDI QIDQ4883064FDOQ4883064
Authors: T. 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
Recommendations
Cites Work
- College Admissions and the Stability of Marriage
- Kernels in perfect line-graphs
- The list chromatic index of a bipartite multigraph
- List-colourings of graphs
- Colorings and orientations of graphs
- Using euler partitions to edge color bipartite multigraphs
- A note on list-colorings
- A new upper bound for the list chromatic number
- The Dinitz problem solved for rectangles
Cited In (11)
- A short proof that the list packing number of any graph is well defined
- Completing partial schedules for open shop with unit processing times and routing
- List edge and list total colourings of multigraphs
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- Hall parameters of complete and complete bipartite graphs
- Title not available (Why is that?)
- A short list color proof of Grötzsch's theorem
- Edge-coloring almost bipartite multigraphs
- A vertex-splitting lemma, de Werra's theorem and improper list colourings
- How not to prove the Alon-Tarsi conjecture
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
This page was built for publication: Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883064)
