Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Analysis of ODD/ODD vertex removal games on special graphs
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.).
(English)Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

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 order to be able to show that there are graphs in the odd/odd vertex removal game for every possible Grundy value. Only the proof of the latter is incomplete and depends on this new conjecture.

Identifiers
URN: urn:nbn:se:kth:diva-102725OAI: oai:DiVA.org:kth-102725DiVA: diva2:556204
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Available from: 2012-09-24 Created: 2012-09-24 Last updated: 2012-09-24Bibliographically approved

Open Access in DiVA

fulltext(597 kB)33 downloads
File information
File name FULLTEXT01.pdfFile size 597 kBChecksum SHA-512
83ca03172e030ef95e7628e3ca72d8a28caa0540c1c0f9266844781ed2501833f1bb6437ce22bc746c25bd18f38d3d5f2b53417065acd19adcd8d01b33cbf2b9
Type fulltextMimetype application/pdf
OliverK(597 kB)83 downloads
File information
File name FULLTEXT02.pdfFile size 597 kBChecksum SHA-512
83ca03172e030ef95e7628e3ca72d8a28caa0540c1c0f9266844781ed2501833f1bb6437ce22bc746c25bd18f38d3d5f2b53417065acd19adcd8d01b33cbf2b9
Type fulltextMimetype application/pdf

By organisation
Mathematics (Dept.)

Search outside of DiVA

GoogleGoogle Scholar
Total: 116 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

urn-nbn

Altmetric score

urn-nbn
Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf