A short proof for a generalization of Vizing's theorem

DOI10.1002/JGT.3190150309MaRDI QIDQ3351376zbMATH OpenOpenAlexFDO

Authors Jean-Claude Fournier, C. 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

zbMATH Keywords

chromatic indexedge colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A generalization of edge-coloring in graphs
• A new method of proving theorems on chromatic index
• On Vizing's bound for the chromatic index of a multigraph
• A refinement of Vizing's theorem
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs

Cited in

(22)

• A constructive proof of Vizing's theorem
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
• Chromatic index of hypergraphs and Shannon's theorem
• Extension from precoloured sets of edges
• A Vizing-type theorem for matching forests
• An application of matching theory of edge-colourings
• A refinement of Vizing's theorem
• Chromatic index of simple hypergraphs
• Data migration on parallel disks: Algorithms and evaluation
• Edge-coloring of multigraphs
• Kőnig's line coloring and Vizing's theorems for graphings
• Solution of Vizing's problem on interchanges for the case of graphs with maximum degree 4 and related results
• scientific article; zbMATH DE number 3861194 (Why is no real title available?)
• scientific article; zbMATH DE number 3914343 (Why is no real title available?)
• A generalization of edge-coloring in graphs
• scientific article; zbMATH DE number 94690 (Why is no real title available?)
• Improved bounds for the chromatic index of graphs and multigraphs
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
• Precoloring extension of Vizing's theorem for multigraphs
• The chromatic index of hypergraphs with no intersecting multiple 2-edges
• Supermodular extension of Vizing's edge-coloring theorem
• Edge coloring of multigraphs with very high multiplicities

This page was built for publication: A short proof for a generalization of Vizing's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3351376)