The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)

DOI10.1007/s00373-011-1068-4zbMath1256.05077OpenAlexW2069337358MaRDI QIDQ1926022

Diego Scheide, Michael Stiebitz

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1068-4

zbMATH Keywords

chromatic indexmaximum degreemaximum multiplicityVizing's boundShannon's bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Measurable versions of Vizing's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• On Vizing's bound for the chromatic index of a multigraph
• An extension of Vizing's adjacency lemma of edge chromatic critical graphs
• On characterizing Vizing's edge colouring bound
• The NP-Completeness of Edge-Coloring
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Maximum matching and a polyhedron with 0,1-vertices
• A Theorem on Coloring the Lines of a Network

This page was built for publication: The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)