A solution to the Misère Shannon switching Game

✍ Scribed by Yahya Ould Hamidoune; Michel Las Vergnas

• Book ID: 103059452
• Publisher: Elsevier Science
• Year: 1988
• Tongue: English
• Weight: 228 KB
• Volume: 72
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(88)90205-1

✦ Synopsis

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 classification as a particular case of the classification of a more general game played on a matroid.