Note on Odd/Odd Vertex Removal Games on Bipartite Graphs
2014 (English)In: Integers: Electronic Journal of Combinatorial Number Theory, ISSN 1553-1732, Vol. 14Article in journal (Refereed) Published
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, which is a generalization of a conjecture of K. Shelton.
Place, publisher, year, edition, pages
2014. Vol. 14
vertex removal games, combinatorics, combinatorial game theory, graphs, bipartite graphs, Grundy value
Research subject Mathematics
IdentifiersURN: urn:nbn:se:su:diva-111216OAI: oai:DiVA.org:su-111216DiVA: diva2:774859