Games without repetitions on graphs with vertex disjoint cycles

DOI10.1007/S000130050118MaRDI QIDQ1383679zbMATH OpenOpenAlexFDO

Authors Jerzy Michael, W. Szwiec, Zyta Dziechcińska-Halamoda

Publication date 17 November 1998

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000130050118

zbMATH Keywords

games without repetitionsgraphs with vertex disjoint cycles

Mathematics Subject Classification ID

Graph theory (05C99) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• Games without repetitions on trees and multitrees
• Optional games on cycles and complete graphs
• Voronoi Games on Cycle Graphs
• scientific article; zbMATH DE number 7355464
• scientific article; zbMATH DE number 1076137
• scientific article; zbMATH DE number 2024632
• On Acyclicity of Games with Cycles
• On acyclicity of games with cycles
• Game domination numbers of a disjoint union of paths and cycles
• Game total domination for cyclic bipartite graphs

Cited in

(4)

• Games without repetitions on trees and multitrees
• Games without repetitions on digraphs
• Cyclic decomposition of sets, set-splitting digraphs and cyclic classes of risk-free games
• Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game

This page was built for publication: Games without repetitions on graphs with vertex disjoint cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383679)