On the Lengths of Symmetry Breaking-Preserving Games on Graphs

Frank Harary, Wolfgang Slany, Oleg Verbitsky

Given a graph $G$, we consider a game where two players, $A$ and $B$, alternatingly color edges of $G$ in red and in blue respectively. Let $l(G)$ be the maximum number of moves in…