Total colorings of \(F_5\)-free planar graphs with maximum degree 8

zbMath1300.05092MaRDI QIDQ405156

Hui-Juan Wang, Zhan-Hai Guo, Jian Chang, Jian Liang Wu

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p56

zbMATH Keywords

cycleplanar graphtotal coloring

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 (2)

Total coloring of planar graphs without chordal 7-cycles ⋮ Total colorings-a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing total colorings of planar graphs
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• 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 colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• 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: Total colorings of \(F_5\)-free planar graphs with maximum degree 8