2 citations · 7 across the 10 of their papers we have counts for
10 papers
On the variety of general position problems under vertex and edge removal
Jing Tian, Pakanun Dokyeesun, Sandi Klavžar
Let , , and be the total, the outer, and the dual general position number of a graph , respectively. This paper i…
Visibility in graphs under edge and vertex removal
Pakanun Dokyeesun, Csilla Bujtás
For a connected graph and , we say that two vertices , are -visible if there is a shortest -path with . If eve…
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…
Thresholds for the biased Maker-Breaker domination games
Boštjan Brešar, Csilla Bujtás, Pakanun Dokyeesun +1
In the -biased Maker-Breaker domination game, two players alternately select unplayed vertices in a graph such that Dominator selects and Staller selects vertice…
General position problems in strong and lexicographic products of graphs
Pakanun Dokyeesun, Sandi Klavžar, Dorota Kuziak +1
Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general…
The general position number under vertex and edge removal
Pakanun Dokyeesun, Sandi Klavžar, Jing Tian
Let be the general position number of a graph . It is proved that holds for any vertex of a connected graph and that if $x…
Maker-Breaker domination game on Cartesian products of graphs
Pakanun Dokyeesun
The Maker-Breaker domination game is played on a graph by two players, called Dominator and Staller. They alternately select an unplayed vertex in . Dominator wins the game…
Maker-Breaker domination game on trees when Staller wins
Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar
In the Maker-Breaker domination game played on a graph , Dominator's goal is to select a dominating set and Staller's goal is to claim a closed neighborhood of some vertex. We s…
Thresholds for the monochromatic clique transversal game
Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar
We study a recently introduced two-person combinatorial game, the -monochromatic clique transversal game which is played by Alice and Bob on a graph . As we observe, this…
Fast winning strategies for Staller in the Maker-Breaker domination game
Csilla Bujtás, Pakanun Dokyeesun
The Maker-Breaker domination game is played on a graph by two players, called Dominator and Staller, who alternately choose a vertex that has not been played so far. Dominator…