Total colorings of planar graphs without 6-cycles and adjacent 5-cycles

DOI10.6040/J.ISSN.1671-9352.0.2015.041MaRDI QIDQ2824287zbMATH OpenOpenAlexFDO

Authors Xiang Tan

Publication date 6 October 2016

Published in Journal of Shandong University. Natural Science (Search for Journal in Brave)

Full work available at URL http://lxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1671-9352.0.2015.041

zbMATH Keywords

adjacent 5-cycleplanar graphtotal coloring

Mathematics Subject Classification ID

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

Recommendations

• Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
• Total colorings of planar graphs without adjacent 5-cycles.
• Total coloring of planar graphs without adjacent chordal 6-cycles
• Total coloring of planar graphs without 6-cycles
• Total colorings of planar graphs without small cycles

Cited in

(10)

• \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
• Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
• Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
• ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
• A note on the total coloring of planar graphs without adjacent 4-cycles
• Total colorings of planar graphs without adjacent 5-cycles.
• Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
• Total coloring of planar graphs without 6-cycles
• Local condition for planar graphs of maximum degree 6 to be total 8-colorable
• Total colorings of planar graphs without small cycles

This page was built for publication: Total colorings of planar graphs without 6-cycles and adjacent 5-cycles

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