A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable

DOI10.1016/j.dam.2017.01.036zbMath1465.05051arXiv1812.00133OpenAlexW2593215865MaRDI QIDQ2030446

Jin Xu, En-Qiang Zhu

Publication date: 7 June 2021

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

Full work available at URL: https://arxiv.org/abs/1812.00133

zbMATH Keywords

planar graphtotal coloring4-fan

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (3)

A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable ⋮ Total colorings-a survey ⋮ Total coloring of recursive maximal planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Local condition for planar graphs of maximum degree 6 to be total 8-colorable
• Total colorings of planar graphs without adjacent triangles
• The total chromatic number of any multigraph with maximum degree five is at most seven
• On the total coloring of planar graphs.
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable