Winning an Independence Achievement Game.
The game "Generalized Kayles (or Independence Achievement)" is played by two players A and B on an arbitrary graph G. The players alternate removing a vertex and its neighbors from G, the winner being the last player with a nonempty set from which to choose. In this thesis, we present wi...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Digital Commons @ East Tennessee State University
2003
|
| Subjects: | |
| Online Access: | https://dc.etsu.edu/etd/797 https://dc.etsu.edu/cgi/viewcontent.cgi?article=1954&context=etd |