7 citations · 11 across the 9 of their papers we have counts for
15 papers
On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products
Nina Chiarelli, Vesna Iršič Chenoweth, Marko Jakovac +2
We continue research on the burning game on graphs. Given a graph , two players, Burner and Staller, take turns in selecting vertices of to burn. All burned vertices spread…
Token positional games
Guillaume Bagan, Quentin Deschamps, Florian Galliot +2
The classical Maker-Breaker positional game is played on a board which is a hypergraph , with two players, Maker and Breaker, alternately claiming vertices of $\mathca…
Graphs with span 1 and shortest optimal walks
Tanja Dravec, Mirjana Mikalački, Andrej Taranenko
A span of a given graph is the maximum distance that two players can keep at all times while visiting all vertices (edges) of and moving according to certain rules, that pr…
Poset Positional Games
Guillaume Bagan, Eric Duchêne, Florian Galliot +5
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset…
Multistage Positional Games
Juri Barkey, Dennis Clemens, Fabian Hamann +2
We initiate the study of a new variant of the Maker-Breaker positional game, which we call multistage game. Given a hypergraph and a bias $b…
Maker-Breaker total domination game on cubic graphs
Jovana Forcan, Mirjana Mikalački
We study Maker--Breaker total domination game played by two players, Dominator and Staller, on the connected cubic graphs. Staller (playing the role of Maker) wins if she manages t…
Fast Strategies in Waiter-Client Games on
Dennis Clemens, Pranshu Gupta, Fabian Hamann +3
Waiter-Client games are played on some hypergraph , where denotes the family of winning sets. For some bias , during each round of such a game Wai…
Spanning Structures in Walker--Breaker Games
Jovana Forcan, Mirjana Mikalački
We study the biased Walker--Breaker games, played on the edge set of the complete graph on vertices, . These games are a variant of the Maker--Breaker games with t…
On the WalkerMaker-WalkerBreaker games
Jovana Forcan, Mirjana Mikalački
We study the unbiased WalkerMaker-WalkerBreaker games on the edge set of the complete graph on vertices, , a variant of well-known Maker-Breaker positional games, where bo…
The Toucher-Isolator game
Chris Dowden, Mihyun Kang, Mirjana Mikalački +1
We introduce a new positional game called `Toucher-Isolator', which is a quantitative version of a Maker-Breaker type game. The playing board is the set of edges of a given graph G…
How fast can Maker win in fair biased games?
Dennis Clemens, Mirjana Mikalački
We study (a:a) Maker-Breaker games played on the edge set of the complete graph on n vertices. In the following four games - perfect matching game, Hamilton cycle game, star factor…
Fast strategies in biased Maker--Breaker games
Mirjana Mikalački, Miloš Stojaković
We study the biased Maker--Breaker positional games, played on the edge set of the complete graph on vertices, . Given Breaker's bias , possibly depending on $n…
A remark on the Tournament game
Dennis Clemens, Mirjana Mikalački
We study the Maker-Breaker tournament game played on the edge set of a given graph . Two players, Maker and Breaker claim unclaimed edges of in turns, and Maker wins if by t…
Avoider-Enforcer star games
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy +3
In this paper, we study Avoider-Enforcer games played on the edge set of the complete graph on vertices. For every constant we analyse the -star game, wh…
Doubly biased Maker-Breaker Connectivity game
Dan Hefetz, Mirjana Rakić, Miloš Stojaković
In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge-set of the complete graph on n vertices. We determine the winner for almost all values of a a…