A Guide to Graph Colouring¶
Lewis, R. M. R. (2021). A Guide to Graph Colouring: Algorithms and Applications. Springer.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Graph Coloring
- In logic puzzles a Sudoku is a graph coloring on an 81-vertex graph with row, column, and box conflicts and nine colours.
This sourceTreats Sudoku and Latin squares as graph-coloring instances (an 81-vertex grid graph with row/column/box cliques, nine colors) alongside scheduling and frequency-assignment applications.
- In logic puzzles a Sudoku is a graph coloring on an 81-vertex graph with row, column, and box conflicts and nine colours.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:a0dc9fe73c17 · see in the full table