The oriented cycle game

DOI10.1016/S0012-365X(97)00224-0zbMath0955.91007OpenAlexW2075604634MaRDI QIDQ1584260

Béla Bollobás, Tamás T. Szabó

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00224-0

zbMATH Keywords

winning strategygame on a graph

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (05C99)

Related Items (6)

A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ Biased orientation games ⋮ The Random Graph Intuition for the Tournament Game ⋮ Roman game domination number of a graph ⋮ Domination in Digraphs ⋮ ACYCLIC ORIENTATIONS ON THE SIERPINSKI GASKET

Cites Work

• On the decomposition of a graph into stars
• Colorings and orientations of graphs
• Searching for acyclic orientations of graphs
• The acyclic orientation game on random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The oriented cycle game