Eprints of Rényi Institute

Connected graph game

Csirmaz, László (2002) Connected graph game. Studia Scientiarum Mathematicarum Hungarica, 39 (1-2). pp. 129-136.



Two players claim alternatively edges of the complete graph on $n$ vertices. The winner is the one who makes the spanned subgraph with the claimed edges connected. We determine, for each $n$, who wins the game.

Item Type:Article
Keywords and phrases:game homomorphism; winning strategy; combinatorial game; positional game; connected graph
Subjects:91A43 Games involving graphs
91A46 Combinatorial games
91A24 Positional games (pursuit and evasion, etc.)
05C12 Distance in graphs
Divisions:Research Groups > Theoretical cryptography
Last Modified:17 Jul 2009 21:24

Repository Staff Only: item control page