| Display title | Hamiltonian path problem |
| Default sort key | Hamiltonian Path Problem |
| Page length (in bytes) | 21,041 |
| Namespace ID | 0 |
| Page ID | 149646 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 73 |
| Number of page watchers who visited in the last 30 days | 4 |
| Number of redirects to this page | 6 |
| Counted as a content page | Yes |
| Wikidata item ID | Q987652 |
| Local description | Problem of finding a cycle through all vertices of a graph |
| Central description | computational problem in graph theory |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Arvindn (talk | contribs) |
| Date of page creation | 15:25, 21 November 2002 |
| Latest editor | Bobby Cohn (talk | contribs) |
| Date of latest edit | 19:02, 20 August 2024 |
| Total number of edits | 219 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (3) | This page is a member of 3 hidden categories (help):
|
| Transcluded templates (45) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
