A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable

DOI10.1007/S10114-014-3170-ZMaRDI QIDQ2453854zbMATH OpenOpenAlexFDO

Authors Chang Chun Teng, Jiansheng Cai, Guiying Yan

Publication date 11 June 2014

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-014-3170-z

zbMATH Keywords

fan of four adjacent 3-cyclesplanar graphtotal coloring

Mathematics Subject Classification ID

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

Recommendations

• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• scientific article; zbMATH DE number 6311321
• Total colorings of F₅-free planar graphs with maximum degree 8
• Total coloring of planar graphs with maximum degree 8 and without specified subgraphs

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 with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total chromatic number of planar graphs with maximum degree 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

(14)

• On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
• Planar graphs are \(9/2\)-colorable
• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
• Total colorings of planar graphs with sparse triangles
• Plane graphs with maximum degree 9 are entirely 11-choosable
• Minimum total coloring of planar graphs with maximum degree 8
• Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
• Total coloring of planar graphs with maximum degree 8
• Total colorings of F₅-free planar graphs with maximum degree 8
• scientific article; zbMATH DE number 6311321 (Why is no real title available?)
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• Extremal \(P_8\)-free/\(P_9\)-free planar graphs
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable

This page was built for publication: A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable

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