scientific article; zbMATH DE number 1109403

MaRDI QIDQ4374713zbMATH OpenFDO

Authors Oleg V. Borodin

Publication date 25 January 1998

zbMATH Keywords

4-critical plane graphfaceplanar graph

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

• Large faces in 4-critical planar graphs with minimum degree 4
• On the structure of plane graphs of minimum face size 5
• Planar 4-critical graphs with four triangles
• Constructing a Family of 4‐Critical Planar Graphs with High Edge Density

Cited in

(9)

• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Planar graphs without adjacent cycles of length at most seven are 3-colorable
• A step towards the strong version of Havel's three color conjecture
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• A note on 3-choosability of planar graphs without certain cycles
• (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
• Three coloring via triangle counting
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• Planar graphs without adjacent cycles of length at most five are (1,1,0)-colorable

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 Q4374713)