Games without repetitions on digraphs
type: Item
instance of: scholarly article
title: Games without repetitions on digraphs
zbMATH Open document ID: 0798.90150
DOI: 10.1007/BF01194854
author: Jerzy Michael
author: W. Szwiec
author: Zyta Dziechcińska-Halamoda
published in: Archiv der Mathematik
publication date: 1994-05-24T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 572366
zbMATH Keywords: Nim
zbMATH Keywords: finite directed graph
zbMATH Keywords: strongly connected digraphs
zbMATH Keywords: simple cycles
MaRDI profile type: Publication
cites work: Q3277097
cites work: Q4128306
full work available at URL: https://doi.org/10.1007/bf01194854
OpenAlex ID: W2017482081
Recommended article: Game-perfect digraphs
Recommended article: Games without repetitions on graphs with vertex disjoint cycles
Recommended article: Games without repetitions on trees and multitrees
Recommended article: Digraph competitions and cooperative games
Recommended article: Lexicographic composition of simple games
Recommended article: Q3511139
Recommended article: Q4627317
Recommended article: Q4934562
Recommended article: Q5289274
Recommended article: Guessing games on triangle-free graphs
description: scientific article; zbMATH DE number 572366