A Survey of the Game “Lights Out!” (Q2848975): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On three zero‐sum Ramsey‐type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity dimension for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4874588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized planar matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-z(mod k) dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected odd dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domination numbers of the 5 × <i>n</i> and 6 × <i>n</i> grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum All-Ones Problem for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight upper bounds for the domination numbers of graphs with given order and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the lamp lighting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in planar graphs with small diameter* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing switch-setting problems<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci polynomials and parity domination in grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Domination Number of Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a series-parallel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination numbers of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Reflected Analyses of Lights Out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merlin's Magic Square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear cellular automata and the garden-of-eden / rank
 
Normal rank
Property / cites work
 
Property / cites work: The σ-Game and Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3980261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of finite cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\sigma\)-Automata and Chebyshev-polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank

Latest revision as of 21:33, 6 July 2024

scientific article
Language Label Description Also known as
English
A Survey of the Game “Lights Out!”
scientific article

    Statements

    A Survey of the Game “Lights Out!” (English)
    0 references
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references