An application of matching theory of edge-colourings

DOI10.1016/0012-365X(96)89437-4zbMath0858.05042OpenAlexW2022269624MaRDI QIDQ1923520

Jerrold R. Griggs, Richard P. Anstee

Publication date: 11 March 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(96)89437-4

zbMATH Keywords

matchingsmultigraphsedge-chromatic number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Extension from precoloured sets of edges ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Chromatic index of hypergraphs and Shannon's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new method of proving theorems on chromatic index
• Matching theory
• Simplified existence theorems for \((g,f)\)-factors
• A short proof for a generalization of Vizing's theorem
• A Theorem on Coloring the Lines of a Network

This page was built for publication: An application of matching theory of edge-colourings