A Survey of the Game “Lights Out!”
From MaRDI portal
Publication:2848975
DOI10.1007/978-3-642-40273-9_13zbMATH Open1395.91075OpenAlexW114270063MaRDI QIDQ2848975FDOQ2848975
Authors: Rudolf Fleischer, Jiajin Yu 
Publication date: 13 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40273-9_13
Recommendations
Cites Work
- Title not available (Why is that?)
- Unit disk graphs
- Perfect codes in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The intractability of computing the minimum distance of a code
- Linear cellular automata and the garden-of-eden
- On the inherent intractability of certain coding problems (Corresp.)
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Title not available (Why is that?)
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- Title not available (Why is that?)
- Title not available (Why is that?)
- The domination number of grids
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- Parity dimension for graphs
- \(\sigma\)-Automata and Chebyshev-polynomials
- Title not available (Why is that?)
- Characterizing switch-setting problems∗
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination in planar graphs with small diameter*
- The domination numbers of the 5 × n and 6 × n grid graphs
- Generalized planar matching
- On the computational complexity of finite cellular automata
- Title not available (Why is that?)
- The σ-Game and Cellular Automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination numbers of planar graphs
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
- Fibonacci polynomials and parity domination in grid graphs
- Universal configurations in light-flipping games
- Merlin's Magic Square
- Note on the lamp lighting problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Connected odd dominating sets in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear algorithm for the domination number of a series-parallel graph
- Title not available (Why is that?)
- On non-z(mod k) dominating sets
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
- The Minimum All-Ones Problem for Trees
- Title not available (Why is that?)
- Decomposition of additive cellular automata
- On three zero‐sum Ramsey‐type problems
- Title not available (Why is that?)
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
- Two Reflected Analyses of Lights Out
Cited In (32)
- Random Lights Out processes on graphs
- Chasing the lights in Lights Out
- A family of multicolor lights out games
- Solutions to all-colors problem on graph cellular automata
- Lights Out on finite graphs
- Lights Out on the hypercube graph over the ring of integers modulo \(k\)
- How to solve the game ``Lights-Out: an application of homomorphism in group theory
- Solving systems of linear equations through zero forcing set
- Title not available (Why is that?)
- On weight-one solvable configurations of the Lights Out puzzle
- An Easy Solution to Mini Lights Out
- A group-labeling version of the Lights Out game
- An iterative strategy for Lights Out on Petersen graphs
- Effects of edge addition or removal on the nullity of a graph
- Two remarks on torus Lights Out puzzle
- Algebra in the game of ``lights-off
- Reversible peg solitaire on graphs
- Merging peg solitaire on graphs
- Linear algebraic approach on real \(\sigma\)-game
- Illuminating a graph.
- Lights Out! On graph products over the ring of integers modulo \(k\)
- On a switch-setting problem arising from a variation of the `Lights Out' game
- Solving alien tiles by an iteration method
- Lights Out! on Cartesian products
- The Lights Out game on subdivided caterpillars.
- ``Lights Out and variants
- Universal configurations in light-flipping games
- Generalized switch-setting problems
- Lights Out on graphs
- A Confused Electrician Uses Smith Normal Form
- Resolution of conjectures related to Lights Out! and Cartesian products
- Fibonacci sequences and the winning conditions for the blackout game
This page was built for publication: A Survey of the Game “Lights Out!”
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848975)
