Pages that link to "Item:Q4883064"
From MaRDI portal
The following pages link to Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064):
Displaying 7 items.
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- A vertex-splitting lemma, de Werra's theorem and improper list colourings (Q1366607) (← links)
- Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
- How<i>not</i>to prove the Alon-Tarsi conjecture (Q2880835) (← links)
- Hall parameters of complete and complete bipartite graphs (Q4798115) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
