---
tag: 0XHZW0VCPR
kind: concept
name: K-colourable graph
msc: [05C15]
sources:
  - url: https://en.wikipedia.org/wiki/Graph_coloring
    locator: Vertex coloring
---

## Summary

A graph is $k$-colourable when it has a proper colouring with $k$ colours. The least such $k$ is the chromatic number. The node [[k-colourable graph|0Y7VDAX8Q3]] gives the precise definition.