| Display title | Graph isomorphism problem |
| Default sort key | Graph isomorphism problem |
| Page length (in bytes) | 41,754 |
| Namespace ID | 0 |
| Page ID | 1950766 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 87 |
| Number of page watchers who visited in the last 30 days | 5 |
| Number of redirects to this page | 4 |
| Counted as a content page | Yes |
| Wikidata item ID | Q3738036 |
| Local description | Unsolved problem in computational complexity theory |
| Central description | computational problem of determining whether two finite graphs are isomorphic |
| Page image |  |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Dcoetzee (talk | contribs) |
| Date of page creation | 19:57, 27 May 2005 |
| Latest editor | David Eppstein (talk | contribs) |
| Date of latest edit | 00:03, 25 April 2025 |
| Total number of edits | 367 |
| Recent number of edits (within past 30 days) | 3 |
| Recent number of distinct authors | 2 |
| Hidden categories (9) | This page is a member of 9 hidden categories (help):
|
| Transcluded templates (69) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
