scientific article; zbMATH DE number 4181366

MaRDI QIDQ3204486zbMATH OpenFDO

Authors Ratko Tošić

Publication date 1984

zbMATH Keywords

digraphpartizan graph gamesWinning strategies

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) 2-person games (91A05)

Recommendations

• Games without repetitions on digraphs
• scientific article; zbMATH DE number 3865312
• Partizan octal games: Partizan subtraction games
• Games without repetitions on trees and multitrees
• Nim games with arbitrary periodic moving orders

Cited in

(20)

• Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
• Cutthroat, an all-small game on graphs
• scientific article; zbMATH DE number 1842075 (Why is no real title available?)
• Chomp on generalized Kneser graphs and others
• On a combinatorial game
• Epidemiography with various growth functions
• Geodetic contraction games on graphs
• Games without repetitions on trees and multitrees
• The game of Take Turn
• scientific article; zbMATH DE number 4097150 (Why is no real title available?)
• On Ringeisen's isolation game
• \textsc{influence}: a partizan scoring game on graphs
• The game of timber!
• Occupation games on graphs in which the second player takes almost all vertices
• Combinatorial graph games
• scientific article; zbMATH DE number 3865312 (Why is no real title available?)
• Number of ties and undefeated signs in a generalized janken
• Octal games on graphs: the game 0.33 on subdivided stars and bistars
• Pirates and treasure
• Analyzing two-color Babylon

This page was built for publication:

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