A sufficient condition for edge 6-colorable planar graphs with maximum degree 6

DOI10.1016/j.dam.2022.01.018zbMath1485.05037OpenAlexW4220881176MaRDI QIDQ832998

Zhengrong Lu, Ling-Sheng Shi

Publication date: 28 March 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.018

zbMATH Keywords

edge coloringplanar graphchromatic indexmaximum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
• On Tutte's extension of the four-colour problem
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• 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

This page was built for publication: A sufficient condition for edge 6-colorable planar graphs with maximum degree 6