Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:combinatorial_game
|
| gptkbp:complexity |
PSPACE-complete
|
| gptkbp:hasBetType |
gptkb:board_game
two-player game impartial game |
| gptkbp:hasFirstPublication |
1978
|
| gptkbp:hasMoveDescription |
players alternately remove an edge and all edges adjacent to it from a graph
|
| gptkbp:hasWinningCondition |
last player to make a move wins
|
| gptkbp:isDefinedOn |
graphs
|
| gptkbp:referencedIn |
Michael R. Garey and David S. Johnson, Computers and Intractability, 1979
E. R. Berlekamp, J. H. Conway, R. K. Guy, Winning Ways for your Mathematical Plays |
| gptkbp:relatedTo |
combinatorial game theory
graph theory |
| gptkbp:variant |
gptkb:Edge_Kayles
gptkb:Kayles |
| gptkbp:bfsParent |
gptkb:PSPACE
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Generalized Edge Kayles
|