Pages that link to "Item:Q2768402"

The following pages link to Universal configurations in light-flipping games (Q2768402):

Displaying 10 items.

• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids (Q596114) (← links)
• The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
• Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
• Lights Out on graphs (Q2088176) (← links)
• Generalized switch-setting problems (Q2461202) (← links)
• Odd neighborhood transversals on grid graphs (Q2643313) (← links)
• A Survey of the Game “Lights Out!” (Q2848975) (← links)
• Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (Q3439135) (← links)
• “Lights Out” and Variants (Q4575440) (← links)