scientific article; zbMATH DE number 6311321

MaRDI QIDQ4980484zbMATH OpenFDO

Authors Huihui Li, Yingqian Wang

Publication date 30 June 2014

zbMATH Keywords

maximum degreetotal coloringfanplane graphs

Mathematics Subject Classification ID

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

Recommendations

• On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• 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
• On total 9-coloring planar graphs of maximum degree seven
• Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
• Every plane graph of maximum degree 8 has an edge-face 9-coloring
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
• Edge-face coloring of plane graphs with maximum degree nine

Cited in

(2)

• Total-Coloring of Plane Graphs with Maximum Degree Nine
• Extremal \(P_8\)-free/\(P_9\)-free planar graphs

This page was built for publication:

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