| Display title | Grinberg's theorem |
| Default sort key | Grinberg's theorem |
| Page length (in bytes) | 9,100 |
| Namespace ID | 0 |
| Page ID | 317169 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Scavis |
| Date of page creation | 19:16, 6 March 2023 |
| Latest editor | imported>Scavis |
| Date of latest edit | 19:16, 6 March 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In graph theory, Grinberg's theorem is a necessary condition for a planar graph to contain a Hamiltonian cycle, based on the lengths of its face cycles. If a graph does not meet this condition, it is not Hamiltonian. The result has been widely used to prove that certain planar graphs constructed to have... |
