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

MaRDI QIDQ2987479zbMATH OpenFDO

Authors Hongwu Hei, Bing-Zhao Li

Publication date 17 May 2017

zbMATH Keywords

adjacent 6-cycleplanar graphtatal 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 6-cycles and adjacent 5-cycles
• Total coloring of planar graphs without 6-cycles
• Total colorings of planar graphs without adjacent 5-cycles.
• Total coloring of planar graphs without adjacent short cycles
• Total colorings of planar graphs without intersecting 5-cycles

Cited in

(11)

• 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
• Total colorings of planar graphs without 6-cycles and adjacent 5-cycles
• Total colorings of planar graphs without intersecting 5-cycles
• Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
• Acyclic total colorings of planar graphs without \(l\) 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 some adjacent cycles
• Total coloring of planar graphs without 6-cycles
• Total colorings of planar graphs without small cycles

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

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