Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable

DOI10.1155/2021/3562513zbMath1477.05082OpenAlexW3172546466MaRDI QIDQ2230029

Wenwen Zhang

Publication date: 17 September 2021

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

Full work available at URL: https://doi.org/10.1155/2021/3562513

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Edge colorings of planar graphs without 5-cycles with two chords
• Edge coloring of embedded graphs with large girth
• Edge colorings of graphs embeddable in a surface of low genus
• Edge coloring of planar graphs without adjacent 7-cycles
• Edge colorings of planar graphs without 6-cycles with three chords
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Edge-coloring critical graphs with high degree
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• A sufficient condition for a planar graph to be class I
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• Every planar graph with maximum degree 7 is of class 1
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable