A refinement of Vizing's theorem

DOI10.1016/S0012-365X(99)00361-1zbMath0949.05028OpenAlexW1998297171MaRDI QIDQ1978167

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

zbMATH Keywords

multigraphchromatic indexedge colouringgrithVizing's theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Maximum Δ-edge-colorable subgraphs of class II graphs ⋮ Set-coloring of edges and multigraph Ramsey numbers ⋮ On characterizing Vizing's edge colouring bound

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