A note on Lights-Out-puzzle: parity-state graphs
From MaRDI portal
Publication:659666
DOI10.1007/S00373-010-0958-1zbMATH Open1234.05164OpenAlexW2010625841MaRDI QIDQ659666FDOQ659666
Authors: Severino V. Gervacio, H. 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
Recommendations
- scientific article; zbMATH DE number 6374006
- Lights Out on finite graphs
- An iterative strategy for Lights Out on Petersen graphs
- A note on the parity assignment problem
- Lights Out for graphs related to one another by constructions
- On configuration graph and paradoxical decomposition
- On weight-one solvable configurations of the Lights Out puzzle
- Graph operations on parity games and polynomial-time algorithms
- Parity, circuits, and the polynomial-time hierarchy
- Notes on the Parity Conjecture
Cites Work
- Linear cellular automata and the garden-of-eden
- Parity dimension for graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The σ-Game and Cellular Automata
- Title not available (Why is that?)
- Parity dominating sets in grid graphs
- Title not available (Why is that?)
- Connected odd dominating sets in graphs
- How to turn all the lights out
Cited In (4)
This page was built for publication: A note on Lights-Out-puzzle: parity-state graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659666)
