IBP-EC
1995/14:
Rapport de Recherche EC /
EC research reports
9 pages - Janvier/January 1996 -
Document en anglais.
PostScript : Ko /Kb
Titre / Title: Directed Switching Games II. The arborescence Game
Abstract : In the arborescence Game, two players, Black and White, play alternately edges of an undirected graph with a specified vertex xo . A move of Black consists of deleting an unplayed edge. A move of White consists of directing an unplayed edge. White wins if he forms a spanning arborescence rooted at xo and loses otherwise.
We characterize winning positions for the Arborescence Game in the case when the graph is a disjoint union of two spanning trees. The general strategy follows