Solutions to all-colors problem on graph cellular automata

DOI10.1155/2019/3164692zbMath1420.05109OpenAlexW2947963844MaRDI QIDQ2325123

Chao Wang, Xiaoyan Zhang

Publication date: 9 September 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/3164692

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Cellular automata (computational aspects) (68Q80) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Random Lights Out processes on graphs
• Parallel discrete dynamical systems on independent local functions
• Lit-only \(\sigma \)-game on pseudo-trees
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
• Theory of cellular automata: a survey
• Linear cellular automata and the garden-of-eden
• Discrete dynamical systems on graphs and Boolean functions
• Parallel discrete dynamical systems on maxterm and minterm Boolean functions
• Two-lit trees for lit-only \(\sigma \)-game
• \(\sigma\)-Automata and Chebyshev-polynomials
• Lit-only sigma game on a line graph
• A Survey of the Game “Lights Out!”
• Cycle equivalence of graph dynamical systems
• On a variant of the Erdős-Ginzburg-Ziv problem
• Note on a variant of the Erdős–Ginzburg–Ziv problem
• Resolution of Conjectures Related to Lights Out! and Cartesian Products
• The σ-Game and Cellular Automata
• Updating method for the computation of orbits in parallel and sequential dynamical systems
• Note on the lamp lighting problem

This page was built for publication: Solutions to all-colors problem on graph cellular automata