A note on the minimum total coloring of planar graphs

DOI10.1007/s10114-016-5427-1zbMath1346.05086OpenAlexW2460135050MaRDI QIDQ326982

Yan Gu, Zhao Yang Luo, Hong Wei Gao, Bin Liu, Hui-Juan Wang

Publication date: 13 October 2016

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

Full work available at URL: https://doi.org/10.1007/s10114-016-5427-1

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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum total coloring of planar graph
• Total coloring of planar graphs without chordal short cycles
• Determining the total colouring number is NP-hard
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Total colouring regular bipartite graphs is NP-hard
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total colourings of graphs
• Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• Total coloring of planar graphs without some chordal 6-cycles
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• On total 9-coloring planar graphs of maximum degree seven
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Edge and total coloring of interval graphs

This page was built for publication: A note on the minimum total coloring of planar graphs