Path achievement games

MaRDI QIDQ2712505zbMATH OpenFDO

Authors Ian M. Wanless

Publication date 26 October 2001

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

games on graphspath achievement games

Mathematics Subject Classification ID

Paths and cycles (05C38) Games involving graphs (91A43)

Review text

Consider the following game, played with two players. The game starts with the empty graph on \(n\) vertices, and the players alternatingly add an edge until the graph has a path of \(p\) edges. This paper analyses which player has a winning strategy for \(p\leq 6\) and gives a winning strategy. For \(p=1,2,3\), this is trivial. For \(p=4\), the paper shows that player 1 has a winning strategy if \(n\bmod 4= 2\) or \(n\) mod \(4=3\). For \(p=5\), player 1 wins iff \(n\bmod 4 \neq 1\), i.e., for \(p=4\), \(p=5\), the game has periodicity 4. For \(p=6\) a similar result is given, but now with periodicity 84.

Recommendations

• scientific article; zbMATH DE number 1076137
• scientific article; zbMATH DE number 123315
• scientific article; zbMATH DE number 3900800
• scientific article; zbMATH DE number 969183
• On Degree Achievement and Avoidance Games for Graphs

Cited in

(4)

• On Erdős's Eulerian trail game
• The oriented path game
• An Achievement Game on a Cycle
• Impartial hypergraph games

This page was built for publication: Path achievement games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712505)