A note on Lights-Out-puzzle: parity-state graphs

DOI10.1007/s00373-010-0958-1zbMath1234.05164OpenAlexW2010625841MaRDI QIDQ659666

Severino V. Gervacio, Hiroshi Maehara

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0958-1

zbMATH Keywords

solvable graphdependencyLights-Out-puzzleparity-state graph

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Random Lights Out processes on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parity dimension for graphs
• Linear cellular automata and the garden-of-eden
• The σ-Game and Cellular Automata
• Connected odd dominating sets in graphs
• How to turn all the lights out