Characterising and recognising game-perfect graphs
Consider a vertex colouring game played on a simple graph with 𝑘 permissible colours. Two players, a <i>maker</i> and a <i>breaker</i>, take turns to colour an uncoloured vertex such that adjacent vertices receive different colours. The game ends once the graph is fully colou...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Episciences.org
2019
|