Total colorings of planar graphs without adjacent triangles

DOI10.1016/j.disc.2007.12.071zbMath1189.05065OpenAlexW1970135621MaRDI QIDQ998509

Jian-Feng Hou, Xiang Yong Sun, Yu-wen Wu, Jian Liang Wu

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.071

zbMATH Keywords

planar graphtotal chromatic numbertotal coloring3-cycle

Mathematics Subject Classification ID

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

Related Items

Facial list colourings of plane graphs ⋮ On total colorings of some special 1-planar graphs ⋮ A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable ⋮ Total coloring of planar graphs without 6-cycles ⋮ Total colorings-a survey ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ Acyclic total colorings of planar graphs without \(l\) cycles ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Local condition for planar graphs of maximum degree 7 to be 8-totally colorable ⋮ Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable ⋮ On total chromatic number of direct product graphs ⋮ A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable ⋮ A larger family of planar graphs that satisfy the total coloring conjecture ⋮ Total coloring of recursive maximal planar graphs ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles

Cites Work

• Unnamed Item
• 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
• Total colourings of planar graphs with large girth
• Total colourings of graphs
• On total 9-coloring planar graphs of maximum degree seven
• A note on total colorings of planar graphs without 4-cycles