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

DOI10.1007/S10114-014-3170-ZzbMath1290.05071OpenAlexW1972380677MaRDI QIDQ2453854

Chang Chun Teng, Gui Ying Yan, Jian-Sheng Cai

Publication date: 11 June 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-014-3170-z

zbMATH Keywords

planar graphtotal coloringfan of four adjacent 3-cycles

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Total coloring of planar graphs without 6-cycles
• Total colorings of planar graphs without small cycles
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Total colorings of planar graphs with maximum degree at least 8
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• Total chromatic number of planar graphs with maximum degree ten
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• Total colorings of planar graphs with large maximum degree

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