Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

DOI10.1007/s11425-012-4531-7zbMath1257.05038OpenAlexW2253575531MaRDI QIDQ1934390

Gui Ying Yan, Guang-Hui Wang, Jian-Sheng Cai

Publication date: 28 January 2013

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-012-4531-7

zbMATH Keywords

planar graphtotal chromatic numbertotal coloringtriangleschordal 4-cycles

Mathematics Subject Classification ID

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

Related Items (5)

Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ Total colorings-a survey ⋮ Total colorings of planar graphs with sparse triangles ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable

Cites Work

• Unnamed Item
• Total coloring of planar graphs without 6-cycles
• Total coloring of embedded graphs of maximum degree at least ten
• Total colorings of planar graphs without small cycles
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Planar graphs without 5-cycles or without 6-cycles
• 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
• 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: Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable