论文标题
网格周期的游戏，然后选择theta图
The Game of Cycles for Grids and Select Theta Graphs
论文作者
论文摘要
我们正在调查谁在一个游戏中具有获胜策略，在该游戏中，两个玩家转弯箭头试图在图中完成周期单元。循环单元是一个没有和弦的循环。我们检查了获胜策略以前未知的游戏板。从$ c_ {5} $开始，共享两个连续的边缘，并用$ c_ {7} $我们求解涉及“堆叠”多边形的多个类图。然后，我们扩展并改善了以前的定理和猜想，并提供了一些与周期游戏有关的研究方向。弗朗西斯·苏（Francis Su）在他的《人类蓬勃发展》一书中描述了原始游戏。游戏中的第一个结果发表在Cycles Arxiv的游戏中：Arch-Ever/04.00776。
We are investigating who has the winning strategy in a game in which two players take turns drawing arrows trying to complete cycle cells in a graph. A cycle cell is a cycle with no chords. We examine game boards where the winning strategy was previously unknown. Starting with a $C_{5}$ sharing two consecutive edges with a $C_{7}$ we solve multiple classes of graphs involving "stacked" polygons. We then expand upon and improve previous theorems and conjectures, and offer some new directions of research related to the Game of Cycles. The original game was described by Francis Su in his book Mathematics for Human Flourishing. The first results on the game were published in The Game of Cycles arXiv:arch-ive/04.00776.
