Pakanun Dokyeesun

most citedThresholds for the monochromatic clique transversal game

1 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2025

Visibility in graphs under edge and vertex removal

Pakanun Dokyeesun, Csilla Bujtás

For a connected graph $G$ and $X \subseteq V (G)$ , we say that two vertices $u$ , $v$ are $X$ -visible if there is a shortest $u, v$ -path $P$ with $V (P) \cap X \subseteq {u, v}$ . If eve…

math.CO2022★ 1 cited

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 $(a, b)$ -monochromatic clique transversal game which is played by Alice and Bob on a graph $G$ . As we observe, this…

math.CO2022★ 1 cited

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 $G$ by two players, called Dominator and Staller, who alternately choose a vertex that has not been played so far. Dominator…