Grinberg's theorem, in graph theory, gives a necessary condition, based on the lengths of the faces of a planar embedding, for a planar graph to have a Hamiltonian cycle; a graph that fails the condition cannot be Hamiltonian. Established in 1968 by the Latvian mathematician Emanuel Grinberg, the theorem follows readily from Euler's formula and has been used to construct counterexamples to Tait's conjecture about Hamiltonian cycles in cubic polyhedral graphs. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Source Grinberg's theorem (Wikipedia)
Sources
1. Grinberg's theorem (Wikipedia)
Lead paragraph
who proved it in 1968
In Branch: Graph Theory, Lead sentence
In graph theory, Grinberg's theorem is a necessary condition for a planar graph to contain a Hamiltonian cycle, based on the lengt
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.