Achieving maximum chromatic index in multigraphs

DOI10.1016/J.DISC.2008.04.023zbMath1198.05065OpenAlexW1999565878MaRDI QIDQ1025461

J. M. Mcdonald

Publication date: 19 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.023

zbMATH Keywords

multigraphchromatic indexsubgraphodd-girthGoldberg's upper boundVizing's upper bound

Mathematics Subject Classification ID

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

Related Items (5)

On a limit of the method of Tashkinov trees for edge-colouring ⋮ On a theorem of Goldberg ⋮ On multiples of simple graphs and Vizing's theorem ⋮ Edge coloring multigraphs without small dense subsets ⋮ On characterizing Vizing's edge colouring bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic index of multigraphs without large triangles
• On the fractional chromatic index of a graph and its complement
• Edge-coloring of multigraphs: Recoloring technique
• 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
• 25 pretty graph colouring problems

This page was built for publication: Achieving maximum chromatic index in multigraphs