Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
From MaRDI portal
Publication:4883064
Recommendations
Cites work
- A new upper bound for the list chromatic number
- A note on list-colorings
- College Admissions and the Stability of Marriage
- Colorings and orientations of graphs
- Kernels in perfect line-graphs
- List-colourings of graphs
- The Dinitz problem solved for rectangles
- The list chromatic index of a bipartite multigraph
- Using euler partitions to edge color bipartite multigraphs
Cited in
(11)- A short proof that the list packing number of any graph is well defined
- List edge and list total colourings of multigraphs
- Completing partial schedules for open shop with unit processing times and routing
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- Hall parameters of complete and complete bipartite graphs
- A short list color proof of Grötzsch's theorem
- scientific article; zbMATH DE number 1334629 (Why is no real title available?)
- 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)
