Change search
ReferencesLink to record
Permanent link

Direct link
Note on Odd/Odd Vertex Removal Games on Bipartite Graphs
Stockholm University, Faculty of Science, Department of Mathematics.
2014 (English)In: Integers: Electronic Journal of Combinatorial Number Theory, ISSN 1553-1732, Vol. 14Article in journal (Refereed) Published
Abstract [en]

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
Keyword [en]
vertex removal games, combinatorics, combinatorial game theory, graphs, bipartite graphs, Grundy value
National Category
Discrete Mathematics
Research subject
URN: urn:nbn:se:su:diva-111216OAI: diva2:774859
Available from: 2014-12-29 Created: 2014-12-29 Last updated: 2015-01-08Bibliographically approved

Open Access in DiVA

fulltext(185 kB)76 downloads
File information
File name FULLTEXT01.pdfFile size 185 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links
By organisation
Department of Mathematics
In the same journal
Integers: Electronic Journal of Combinatorial Number Theory
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 76 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 83 hits
ReferencesLink to record
Permanent link

Direct link