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

DOI10.1016/J.DAM.2011.01.001MaRDI QIDQ534337zbMATH OpenOpenAlexFDO

Authors Gerard Jennhwa Chang, Nicolas Roussel, Jianfeng 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 coloringtotal chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Local condition for planar graphs of maximum degree 6 to be total 8-colorable
• A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
• Total coloring of planar graphs with maximum degree \(7\)
• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• Total coloring of planar graphs with maximum degree seven
• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
• Total coloring of planar graphs with maximum degree 8
• Total coloring of planar graphs of maximum degree eight
• Total colorings of planar graphs with maximum degree at least 8

Cites work

• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• Local condition for planar graphs of maximum degree 6 to be total 8-colorable
• On Total Chromatic Number of a Graph
• On the total coloring of certain graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• The total coloring of a multigraph with maximal degree 4
• Total chromatic number of planar graphs with maximum degree ten
• Total coloring of planar graphs of maximum degree eight
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs with maximum degree at least 8
• Total colorings of planar graphs without adjacent triangles
• Total colorings of planar graphs without small cycles
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(17)

• Total coloring of planar graphs without chordal 7-cycles
• Total colorings of planar graphs with sparse triangles
• Total coloring of planar graphs with maximum degree 8
• Total colorings of F₅-free planar graphs with maximum degree 8
• A note on the total coloring of planar graphs without adjacent 4-cycles
• Total colorings of planar graphs without intersecting 5-cycles
• Total coloring of planar graphs without chordal short cycles
• Total colorings-a survey
• Total coloring of planar graphs without short cycles
• Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
• A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
• Total coloring of planar graphs without some chordal 6-cycles
• Total colorings of planar graphs without chordal 6-cycles
• Edge coloring of graphs embedded in a surface of nonnegative characteristic
• Total coloring of planar graphs without adjacent chordal 6-cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534337)