A new method of proving theorems on chromatic index

DOI10.1016/0012-365X(84)90078-5zbMath0553.05035MaRDI QIDQ801928

Andrzej Ehrenfeucht, Vance Faber, Henry A. Kierstead

Publication date: 1984

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

zbMATH Keywords

multigraphmaximum degreemaximum multiplicityedge-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs ⋮ An application of matching theory of edge-colourings ⋮ A game generalizing Hall's theorem ⋮ The core conjecture of Hilton and Zhao ⋮ A new tool for proving Vizing's theorem ⋮ A polyhedral approach to edge coloring ⋮ A comparison of two edge-coloring formulations ⋮ Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation

Cites Work

• Unnamed Item
• Unnamed Item
• On edge-colorings of graphs.
• A Theorem on Coloring the Lines of a Network

This page was built for publication: A new method of proving theorems on chromatic index