Category
page 1Statements about planar graphs
four color theorem
statement in mathematics
Kuratowski's theorem
a finite graph is planar iff it does not contain a subgraph that is a subdivision of K₅ or K₃,₃
Fáry's theorem
theorem that a planar graph admits straight drawings
planar separator theorem
theorem in graph theory
circle packing theorem
theorem describing the possible tangency relations between circles in the plane whose interiors are disjoint
Grötzsch's theorem
theorem that every triangle-free planar graph is 3-colorable
Wagner's theorem
characterization theorem in graph theory of planar graphs
Barnette's conjecture
unsolved problem in graph theory
Schnyder's theorem
order dimension of incidences in planar graphs
Grinberg's theorem
on Hamiltonian cycles in planar graphs
Steinitz's theorem
Characterizes graphs formed by edges and vertices of 3-dimensional convex polyhedra
Tait's conjecture
conjecture in graph theory