Let G be a graph and x0, x, be two different vertices of G. Two players, Black and White, mark alternately non marked edges of G. White loses if and only if he marks all edges of a path connecting xc, and xr. This game is the misere version of the well-known Shannon Switching Game. We give its class
A solution to the Box Game
β Scribed by Yahya Ould Hamidoune; Michel Las Vergnas
- Book ID
- 103057411
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 801 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
**Helpmate** *Knight is home from the hospital, so everything should be back to normal, right? Things are never that easy, though, and the men of Chess must fight to get their lives back.* Knight has returned home from the hospital, but is far from recovered. Things seem to be going well, but depr
The PLAYED trilogy follows the story of tech millionaire Adam Drake and proud geek-girl Mia Strong, from their first scandalous meeting to the love of a lifetime. (Includes never-before-published bonus material) At Any Price To cover her family's mounting debts, gaming blogger Mia decides to aucti
US Marshal Jordan Burke is happy for her partner when he takes a month off for paternity leave, but she's not happy about her substitute partner. Nick Pierce worked for the Topeka Witsec office years ago and left under less than the best of circumstances. When he's asked to fill in he hesitates, but
Steve makes a diamond sword, seeks the culprit who stole the sword, participates in a building competition, goes to rescue friends lost in a treasure-laden temple, helps defend a village from skeletons, and searches for a legendary mountain.;1. The quest for the diamond sword -- 2. The mystery of th