The solitaire clobber game and correducibility of graphs (Q2184676): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3377503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2949114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3629025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solitaire clobber played on Cartesian product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solitaire clobber / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3629024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solitaire Clobber on circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impartial Solitaire Clobber played on Powers of Paths / rank
 
Normal rank

Revision as of 19:22, 22 July 2024

scientific article
Language Label Description Also known as
English
The solitaire clobber game and correducibility of graphs
scientific article

    Statements

    The solitaire clobber game and correducibility of graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2020
    0 references
    graph connectivity
    0 references
    combinatorial games
    0 references
    solitaire clobber
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references