A refinement of Vizing's theorem

DOI10.1016/S0012-365X(99)00361-1zbMATH Open0949.05028OpenAlexW1998297171MaRDI QIDQ1978167FDOQ1978167

Authors: Eckhard Steffen 

Publication date: 3 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00361-1

Recommendations

• A generalization of edge-coloring in graphs
• A short proof for a generalization of Vizing's theorem
• On Vizing's bound for the chromatic index of a multigraph
• On characterizing Vizing's edge colouring bound
• Achieving maximum chromatic index in multigraphs

zbMATH Keywords

multigraphedge colouringgrithchromatic indexVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• Refining Rossberg's theorem
• Set-coloring of edges and multigraph Ramsey numbers
• On characterizing Vizing's edge colouring bound
• Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs
• Title not available (Why is that?)
• Refinement of the theorem of Vahlen

This page was built for publication: A refinement of Vizing's theorem

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