scientific article; zbMATH DE number 1161323

MaRDI QIDQ4393318zbMATH OpenFDO

Authors William F. Klostermeyer, John Goldwasser

Publication date 5 October 1998

zbMATH Keywords

approximation algorithmgridsLights OutNP-completeswitches

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Survey of the Game “Lights Out!”
• Lights Out on graphs
• Lights Out! on Cartesian products
• Resolution of conjectures related to Lights Out! and Cartesian products

Cited in

(21)

• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• Maximum orbit weights in the -game and lit-only -game on grids and graphs
• The solution to Berlekamp's switching game
• The correct solution to Berlekamp's switching game
• Lights Out on graphs
• On weight-one solvable configurations of the Lights Out puzzle
• On the complexity of dominating set problems related to the minimum all-ones problem
• A Survey of the Game “Lights Out!”
• scientific article; zbMATH DE number 6374006 (Why is no real title available?)
• Characterizing switch-setting problems^∗
• ``Lights Out and variants
• Chasing the lights in Lights Out
• Solvable Trees
• Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
• A note on Lights-Out-puzzle: parity-state graphs
• A parameterized perspective of \textsc{all-colors}
• A parameterized perspective of \textsc{All-Colors}
• An extremal problem for the neighborhood lights out game
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
• Minimum light number of lit-only \(\sigma\)-game on a tree
• A solitaire game played on 2-colored graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393318)