|
|
|
|
|
|
|
|
|
|
|
| | Pick a node
with fewer than K neighbours |
|||||||||
| | Remove it and
its edges from the graph |
|||||||||
| | And place onto a
stack of removed nodes |
|||||||||
| | If the remaining
graph can be K- |
|||||||||
| coloured, then
so can the complete |
||||||||||
| graph |
||||||||||
| | Recursively
remove another node
|
|||||||||
