K-colourable graph
Summary
A graph is -colourable when it has a proper colouring with colours. The least such is the chromatic number. The node k-colourable graph gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Graph_coloring, Vertex coloring
About this page
| Tag | 0XHZW0VCPR |
|---|---|
| URI | m2://0XHZW0VCPR |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C15 |
| Specializes | Graph |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.