The following pages link to Note on the lamp lighting problem (Q5956771):
Displayed 16 items.
- Lit-only \(\sigma \)-game on pseudo-trees (Q608278) (← links)
- The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
- The edge-flipping group of a graph (Q966148) (← links)
- Minimum light number of lit-only \(\sigma\)-game on a tree (Q995589) (← links)
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
- Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs (Q1043813) (← links)
- Construction of \(\sigma^+\)-game solutions on a rectangular grid (Q2008579) (← links)
- Solutions to all-colors problem on graph cellular automata (Q2325123) (← links)
- On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
- Generalized switch-setting problems (Q2461202) (← links)
- Lit-only sigma game on a line graph (Q2519798) (← 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)
- Chasing the Lights in Lights Out (Q4692176) (← links)
- Lights Out On A Random Graph (Q5045960) (← links)