On total colorings of some special 1-planar graphs

DOI10.1007/s10255-017-0667-0zbMath1390.05072OpenAlexW2745072630MaRDI QIDQ2401770

Lin Sun, Hua Cai, Jian Liang Wu

Publication date: 5 September 2017

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

Full work available at URL: https://doi.org/10.1007/s10255-017-0667-0

zbMATH Keywords

girthtotal coloringdischarging method1-planar graph\(r\)-minimal graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Total colorings-a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Total coloring of embedded graphs with maximum degree at least seven
• A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
• List edge and list total coloring of 1-planar graphs
• Total colorings of planar graphs without adjacent triangles
• The total coloring of a multigraph with maximal degree 4
• The total chromatic number of any multigraph with maximum degree five is at most seven
• On edge colorings of \(1\)-planar graphs
• On total colorings of 1-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• On the total coloring of certain graphs
• Total Colourings of Graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph