A short proof for a generalization of Vizing's theorem
From MaRDI portal
Publication:3351376
DOI10.1002/jgt.3190150309zbMath0728.05020OpenAlexW2088148599MaRDI QIDQ3351376
Jean-Claude Fournier, Claude Berge
Publication date: 1991
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190150309
Related Items
Data migration on parallel disks: Algorithms and evaluation ⋮ Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results ⋮ On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs ⋮ Extension from precoloured sets of edges ⋮ An application of matching theory of edge-colourings ⋮ KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS ⋮ Improved bounds for the chromatic index of graphs and multigraphs ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Chromatic index of simple hypergraphs ⋮ Chromatic index of hypergraphs and Shannon's theorem ⋮ Edge-coloring of multigraphs
Cites Work
