On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs

DOI10.1016/S0012-365X(96)00086-6zbMath0948.05030WikidataQ124792488 ScholiaQ124792488MaRDI QIDQ1363709

O. Diekmann

Publication date: 19 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

multigraphedge colouringsVizing's theoremVizing's adjacency lemmaVizing's fan argument

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A new method of proving theorems on chromatic index
• Edge-coloring of multigraphs: Recoloring technique
• A short proof for a generalization of Vizing's theorem
• On edge-colorings of graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs