Abstract
Two players play a game on a connected graphG. Each player in his turn occupies an edge ofG. The player who occupies a set of edges that contains a cycle, before the other does it, wins. This game may end in a draw. We call this game the normal cycle game. We define furthermore three similar games, which are called the misère cycle game, the normal cycle cut game and the misère cycle cut game. We characterize the above four games.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Baron andW. Imrich, On the maximal distance of spanning trees,J. Combinatorial Theory 5 (1968), 378–385.
J. Bruno andL. Weinberg, A constructive graph-theoretic solution of the Shannon switching game,IEEE Trans. Circuit Theory 17, 1 (1971), 74–81.
J. Edmonds, Lehman’s switching game and a theorem of Tutte and Nash-Williams,J. Res. NBS 69B (1965), 73–77.
M. Kano, Generalization of Shannon wistching game, to appear.
M. Kano, A class of Shannon switching game played on vertices,Memoirs of The Akashi Technological College 19 (1977), 77–85.
G. Kishi andY. Kajitani, Maximally distant trees and principal partition of a linear graph,IEEE Trans. Circuit Theory 16, 3 (1969), 323–330.
A. Lehman, A solution to the Shannon switching game,SIAM J. Appl. Math. 12 (1964), 687–725.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kano, M. Cycle games and cycle cut games. Combinatorica 3, 201–206 (1983). https://doi.org/10.1007/BF02579294
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02579294