An adjacency Lemma for critical multigraphs

DOI10.1016/J.DISC.2007.08.067zbMath1223.05064OpenAlexW1993734719WikidataQ124792267 ScholiaQ124792267MaRDI QIDQ942112

David Cariolaro

Publication date: 4 September 2008

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

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

zbMATH Keywords

multigraphchromatic indexcritical graphVizing's adjacency lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Some consequences of a theorem on fans
• Planar graphs of maximum degree seven are Class I
• Edge-coloring of multigraphs: Recoloring technique
• On edge-colorings of graphs.
• On fans in multigraphs
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: An adjacency Lemma for critical multigraphs