Achievement and avoidance games for connected graphs having a vertex of degree N

• Main Authors: Antonio, Vilma, Sinfuego, Mary Lou
• Format: text
• Language: English
• Published: Animo Repository 1994
• Subjects: Graph theory; Games of strategy (Mathematics); Groups, Theory of
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/16157
• Institution: De La Salle University

This thesis discusses certain types of achievement and avoidance games for graphs. In theses games, the goal is to achieve or avoid a graph with a certain property. There are two players and the first one to achieve the goal wins the achievement game and loses the misere version or the avoidance gam...