On 4-critical planar graphs with high edge density

DOI10.1016/0012-365X(91)90039-5zbMath0756.05070MaRDI QIDQ1184860

Gerhard Koester

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

4-critical planar graphsproblems of Grünbaum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

Proof of a conjecture of Dirac concerning 4-critical planar graphs ⋮ Large faces in 4-critical planar graphs with minimum degree 4 ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs ⋮ Counterexamples to Grötzsch-Sachs-Koester's conjecture ⋮ Infinite families of 4-chromatic Grötzsch-Sachs graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Note to a problem of T. Gallai and G. A. Dirac
• Subgraphs of colour-critical graphs
• The edge-density of 4-critical planar graphs
• 4-critical 4-valent planar graphs constructed with crowns.

This page was built for publication: On 4-critical planar graphs with high edge density