scientific article; zbMATH DE number 4181366

zbMATH Open0717.05036MaRDI QIDQ3204486FDOQ3204486

Authors: Ratko Tošić 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

digraphpartizan graph gamesWinning strategies

Mathematics Subject Classification ID

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

Cited In (20)

• Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
• Cutthroat, an all-small game on graphs
• Title not available (Why is that?)
• Chomp on generalized Kneser graphs and others
• On a combinatorial game
• Epidemiography with various growth functions
• Geodetic contraction games on graphs
• The game of Take Turn
• Games without repetitions on trees and multitrees
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)