On multiples of simple graphs and Vizing's theorem

DOI10.1016/J.DISC.2010.04.012zbMath1222.05071OpenAlexW2066267861MaRDI QIDQ982630

J. M. Mcdonald

Publication date: 7 July 2010

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

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

zbMATH Keywords

chromatic indexVizing's theoremodd clique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Achieving maximum chromatic index in multigraphs
• The NP-Completeness of Edge-Coloring
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item

This page was built for publication: On multiples of simple graphs and Vizing's theorem