1 citations · 1 across the 5 of their papers we have counts for
5 papers
Criticality for Maker-Breaker domination games with predomination
Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar +1
A predominated graph is a pair , where is a graph and the vertices in are considered already dominated. Maker-Breaker domination game critical (MBD cri…
Generalized saturation game
Balázs Patkós, Miloš Stojaković, Jelena Stratijev +1
We study the following game version of the generalized graph Turán problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the comple…
Avoider-Enforcer Game is NP-hard
Tillmann Miltzow, Miloš Stojaković
In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enforcer alternate in claiming an unclaimed vertex, until all the vertices of the hypergraph are claimed. Enforc…
On strong avoiding games
Miloš Stojaković, Jelena Stratijev
Given an increasing graph property , the strong Avoider-Avoider game is played on the edge set of a complete graph. Two players, Red and Blue, take turns in claimi…
The Constructor-Blocker Game
Balázs Patkós, Miloš Stojaković, Máté Vizer
We study the following game version of the generalized graph Turán problem. For two fixed graphs and , two players, Constructor and Blocker, alternately claim unclaimed edge…