| Display title | Hypohamiltonian graph |
| Default sort key | Hypohamiltonian graph |
| Page length (in bytes) | 22,422 |
| Namespace ID | 0 |
| Page ID | 239819 |
| 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>LinXED |
| Date of page creation | 14:07, 6 February 2024 |
| Latest editor | imported>LinXED |
| Date of latest edit | 14:07, 6 February 2024 |
| 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 the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian. |
