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: | , |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
1994
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_bachelors/16157 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|