Achievement and avoidance games for connected graphs having a vertex of degree N
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1994
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16157 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | 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 game. In particular, it discusses winning strategies for the avoidance game when the goal is either a connected graph or a graph having a vertex of degree n, for n = l, 2,3.The discussion about the achievement and avoidance games for graphs having a vertex of degree n is based on the article On Degree Achievement and Avoidance Games for Graphs by F. Harary and K. Plochinski. The winning strategies for the avoidance game for connected graphs were formulated by the researchers themselves since the article Connect - it Games by F. Harart abd R. Robinson is not locally available. |
|---|