| Display title | Perfect graph theorem |
| Default sort key | Perfect graph theorem |
| Page length (in bytes) | 13,126 |
| Namespace ID | 0 |
| Page ID | 670602 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2800071 |
| Local description | An undirected graph is perfect if and only if its complement graph is also perfect |
| Central description | theorem in graph theory |
| 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 | Charles Matthews (talk | contribs) |
| Date of page creation | 22:03, 21 May 2004 |
| Latest editor | Vstephen B (talk | contribs) |
| Date of latest edit | 20:27, 29 August 2024 |
| Total number of edits | 32 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (5) | This page is a member of 5 hidden categories (help):
|
| Transcluded templates (39) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
