Four coloring for a subset of maximal planar graphs with minimum degree five

DOI10.1007/3-540-61576-8_68MaRDI QIDQ6567665zbMATH OpenFDO

Authors

Publication date 5 July 2024

zbMATH Keywords

planar representationvertex four coloring

Mathematics Subject Classification ID

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

Recommendations

• Transformations for maximal planar graphs with minimum degree five
• The edge colorings of \(K_5\)-minor free graphs
• Edge colorings of planar graphs with maximum degree five.
• A sufficient condition for a planar graph of maximum degree five to be class 1
• Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.

Cites work

• scientific article; zbMATH DE number 3724488 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Another Reducible Edge Configuration
• Heuristic for rapidly four-coloring large planar graphs
• Transformations for maximal planar graphs with minimum degree five

Cited in

(1)

• Transformations for maximal planar graphs with minimum degree five

This page was built for publication: Four coloring for a subset of maximal planar graphs with minimum degree five

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