Publication: A note on the one-colour avoidance game on graphs
All || By Area || By YearTitle | A note on the one-colour avoidance game on graphs | Authors/Editors* | P. Pralat |
---|---|
Where published* | Journal of Combinatorial Mathematics and Combinatorial Computing |
How published* | Journal |
Year* | 2010 |
Volume | 75 |
Number | |
Pages | 85-94 |
Publisher | |
Keywords | |
Link | http://www.math.ryerson.ca/~pralat/research.html |
Abstract |
We consider the one-colour graph avoidance game. Using a high perfor- mance computing network, we showed that the first player can win the game on 13, 14, and 15 vertices. Other related games are also discussed. |
Back to page 16 of list