Analysis of ODD/ODD vertex removal games on special graphs
In this paper we analyze the odd/odd vertex removal game introduced by P. Ottaway. We prove that every bipartite graph has Grundy value 0 or 1 only depending on the parity of the number of edges in the graph. In addition we also reduce a conjecture proposed by K. Shelton to seemingly simpler one, in...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Matematik (Inst.)
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102725 |