Generalized switch-setting problems
From MaRDI portal
Publication:2461202
DOI10.1016/J.DISC.2006.11.021zbMATH Open1127.05100OpenAlexW2068843857MaRDI QIDQ2461202FDOQ2461202
Authors: Torsten Mütze
Publication date: 27 November 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.021
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear programming (90C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph theory (05C99)
Cites Work
- Linear cellular automata and the garden-of-eden
- Title not available (Why is that?)
- \(\sigma\)-Automata and Chebyshev-polynomials
- The σ-Game and Cellular Automata
- Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
- \(\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?)
- How to turn all the lights out
- Merlin's Magic Square Revisited
Cited In (3)
This page was built for publication: Generalized switch-setting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461202)