A parameterized perspective of \textsc{All-Colors}
From MaRDI portal
Publication:6902193
Cites work
- \(\sigma\)-Automata and Chebyshev-polynomials
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
- A single-exponential time 2-approximation algorithm for treewidth
- A Survey of the Game “Lights Out!”
- Can you beat treewidth?
- Graph product structure for h-framed graphs
- scientific article; zbMATH DE number 436064 (Why is no real title available?)
- scientific article; zbMATH DE number 4074498 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161323 (Why is no real title available?)
- scientific article; zbMATH DE number 1934394 (Why is no real title available?)
- scientific article; zbMATH DE number 4114031 (Why is no real title available?)
- Linear cellular automata and the garden-of-eden
- Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
- Note on the lamp lighting problem
- Odd and residue domination numbers of a graph
- On the complexity of dominating set problems related to the minimum all-ones problem
- Parameterized algorithms
- Solutions to all-colors problem on graph cellular automata
- The general \(\sigma \) all-ones problem for trees
- The Minimum All-Ones Problem for Graphs with Small Treewidth
- The Minimum All-Ones Problem for Trees
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The σ-Game and Cellular Automata
- Upper bounds to the clique width of graphs
This page was built for publication: A parameterized perspective of \textsc{All-Colors}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902193)
