Games without repetitions on digraphs (Q1325234): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q760008 |
Changed an Item |
||
Property / author | |||
Property / author: Zyta Dziechcińska-Halamoda / rank | |||
Normal rank |
Revision as of 23:57, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Games without repetitions on digraphs |
scientific article |
Statements
Games without repetitions on digraphs (English)
0 references
24 May 1994
0 references
We consider two-person games of type Nim on a finite directed graph where each are may be used at most once during the playing of the game. We prove that a certain problem of game-partition into winning and losing vertices is reducible to strongly connected digraphs. A complete solution for the problem is given in the special case where the digraph is obtained by sticking together the simple cycles at certain vertices.
0 references
Nim
0 references
finite directed graph
0 references
strongly connected digraphs
0 references
simple cycles
0 references