For the Neighborhood Lights Out game, the paper finds the maximum edge count of n-vertex graphs that are winnable from every labeling, for all odd-parity cases and partial even-even cases.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Extremal Problem for the Neighborhood Lights Out Game
For the Neighborhood Lights Out game, the paper finds the maximum edge count of n-vertex graphs that are winnable from every labeling, for all odd-parity cases and partial even-even cases.