A vertex-splitting lemma, de Werra's theorem and improper list colourings

DOI10.1006/jctb.1997.1793zbMath0888.05030OpenAlexW2009408226MaRDI QIDQ1366607

D. S. G. Stirling, Tomaž Slivnik, Anthony J. W. Hilton

Publication date: 15 September 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1793

zbMATH Keywords

multigraphvertex-splitting lemmacolourlist chromatic indexedge list colouringtheorem of de Werra

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Vizing's and Shannon's theorems for defective edge colouring

Cites Work

• The list chromatic index of a bipartite multigraph
• On A Particular Conference Scheduling Problem
• Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A vertex-splitting lemma, de Werra's theorem and improper list colourings