| Display title | Uniquely colorable graph |
| Default sort key | Uniquely colorable graph |
| Page length (in bytes) | 9,604 |
| Namespace ID | 0 |
| Page ID | 311510 |
| 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 |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Pchauhan2001 |
| Date of page creation | 08:06, 27 June 2023 |
| Latest editor | imported>Pchauhan2001 |
| Date of latest edit | 08:06, 27 June 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, a uniquely colorable graph is a k-chromatic graph that has only one possible (proper) k-coloring up to permutation of the colors. Equivalently, there is only one way to partition its vertices into k independent sets and there is no way to partition them into k − 1 independent sets. |
