Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

DOI10.1007/S11425-012-4531-7MaRDI QIDQ1934390zbMATH OpenOpenAlexFDO

Authors Jiansheng Cai, Guanghui Wang, Guiying Yan

Publication date 28 January 2013

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-012-4531-7

zbMATH Keywords

chordal 4-cyclesplanar graphtotal chromatic numbertotal coloringtriangles

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

• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• scientific article; zbMATH DE number 6795582
• Total colorings of planar graphs without chordal 6-cycles
• Total colorings of planar graphs without small cycles

Cites work

• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Planar graphs without 5-cycles or without 6-cycles
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total coloring of embedded graphs of maximum degree at least ten
• Total coloring of planar graphs without 6-cycles
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• 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 small cycles
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(9)

• On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
• Total colorings of planar graphs with sparse triangles
• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
• Total colorings of F₅-free planar graphs with maximum degree 8
• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• scientific article; zbMATH DE number 6311321 (Why is no real title available?)
• Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
• Total colorings-a survey
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

This page was built for publication: Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

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