Local condition for planar graphs of maximum degree 7 to be 8-totally colorable

DOI10.1016/j.dam.2011.01.001zbMath1223.05037OpenAlexW2001158340MaRDI QIDQ534337

Gerard Jennhwa Chang, Nicolas Roussel, Jian-Feng Hou

Publication date: 17 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.001

zbMATH Keywords

cycleplanar graphstotal chromatic numbertotal coloring

Mathematics Subject Classification ID

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

Related Items

Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ Total colorings-a survey ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ Total colorings of planar graphs with sparse triangles ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Total coloring of planar graphs without some chordal 6-cycles

Cites Work

• Unnamed Item
• Local condition for planar graphs of maximum degree 6 to be total 8-colorable
• Total colorings of planar graphs without small cycles
• Total coloring of planar graphs of maximum degree eight
• Total colorings of planar graphs without adjacent triangles
• Total colorings of planar graphs with maximum degree at least 8
• 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 the total coloring of certain graphs
• Total chromatic number of planar graphs with maximum degree ten
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• Total colorings of planar graphs with large maximum degree
• On Total Chromatic Number of a Graph

This page was built for publication: Local condition for planar graphs of maximum degree 7 to be 8-totally colorable