On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles

DOI10.1016/J.AML.2009.03.009MaRDI QIDQ1033023zbMATH OpenOpenAlexFDO

Authors Lan Shen, Ko-Wei Lih, Yingqian Wang, Weifan Wang

Publication date 6 November 2009

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2009.03.009

zbMATH Keywords

dischargingintersecting trianglesmaximum degreeplanar graphtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
• Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
• Total coloring of planar graphs with maximum degree 8 and without specified subgraphs

Cites work

• Graph theory
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• On Total Chromatic Number of a Graph
• On total chromatic number of planar graphs without 4-cycles
• The total chromatic number of any multigraph with maximum degree five is at most seven
• The total coloring of a multigraph with maximal degree 4
• Total chromatic number of planar graphs with maximum degree ten
• Total colorings of planar graphs with large maximum degree
• Total colourings of graphs
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(11)

• \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
• Total coloring of planar graphs with maximum degree 8
• ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
• Minimum total coloring of planar graph
• Total coloring of planar graphs without chordal short cycles
• scientific article; zbMATH DE number 6311321 (Why is no real title available?)
• Extremal \(P_8\)-free/\(P_9\)-free planar graphs
• Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Total coloring of planar graphs of maximum degree eight

This page was built for publication: On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles

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