Uniquely colorable graph
Summary
In graph theory, a uniquely colorable graph is a -chromatic graph that has only one possible (proper) -coloring up to permutation of the colors. Equivalently, there is only one way to partition its vertices into independent sets and there is no way to partition them into independent sets.
Further reading
- Wikipedia, page 676304, revision 1352721310, Uniquely colorable graph. adopted
About this page
| Tag | HKJCK0GJHW |
|---|---|
| URI | m2://HKJCK0GJHW |
| Aliases | uniquely-edge-colorable-graph, uniquely-total-colorable-graph |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.