A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable

DOI10.1155/2020/3196540MaRDI QIDQ2183240zbMATHOpenAlexFDO

Authors Yongsheng Rao, Enqiang Zhu

Publication date 26 May 2020

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2020/3196540

Mathematics Subject Classification ID

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

Recommendations

• On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• Total colorings of planar graphs without chordal 6-cycles
• Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable

Cites work

• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• Graph theory
• List edge and list total colourings of multigraphs
• On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• On total chromatic number of planar graphs without 4-cycles
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total coloring of planar graphs without 6-cycles
• Total colorings of planar graphs without adjacent triangles
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(5)

• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
• A larger family of planar graphs that satisfy the total coloring conjecture

This page was built for publication: A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable

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