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 winning strategies for some paths.
","abstract_html":"<p>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 winning strategies for some paths.</p>","abstract_has_math":false,"creators":["Taylor, Mark C."],"institution":null,"degree_name":"MS (Master of Science)","degree_level":"Thesis - unrestricted","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2003,"date_issued":"2003-08-11T07:00:00Z","date_published":"2003-08-11T07:00:00Z","updated_at":"2026-07-24T02:19:21Z","subjects":["path","graph theory","achievement","independence","Physical Sciences and Mathematics"],"languages":[],"rights":["Copyright by the authors."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://dc.etsu.edu/etd/797","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Taylor, Mark C."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2003-08-11T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis - unrestricted"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS (Master of Science)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["path","graph theory","achievement","independence","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Copyright by the authors."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.etsu.edu/context/etd/article/1954/viewcontent/TaylorM072203f.pdf","https://dc.etsu.edu/etd/797"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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 winning strategies for some paths.
"]},{"key":"dc:title","label":"Title","values":["Winning an Independence Achievement Game."]}]}],"canonical_facts":{"dc:creator":["Taylor, Mark C."],"dc:date.issued":["2003-08-11T07:00:00Z"],"dc:description.abstract":["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 winning strategies for some paths.
"],"dc:identifier":["https://dc.etsu.edu/context/etd/article/1954/viewcontent/TaylorM072203f.pdf","https://dc.etsu.edu/etd/797"],"dc:rights":["Copyright by the authors."],"dc:subject":["path","graph theory","achievement","independence","Physical Sciences and Mathematics"],"dc:title":["Winning an Independence Achievement Game."],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis - unrestricted"],"thesis:degree_name":["MS (Master of Science)"]},"updated_at":"2026-07-24T02:19:21Z"}