3 citations · 4 across the 4 of their papers we have counts for
15 papers
Domination and independence number of large -crossing-critical graphs
Vesna Iršič, Maruša Lekše, Mihael Pačnik +2
After -crossing-critical graphs were characterized in 2016, their most general subfamily, large -connected -crossing-critical graphs, has attracted separate attention. Thi…
-conjectures on the domination game and claw-free graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
Let be the game domination number of a graph . Rall conjectured that if is a traceable graph, then . Our main re…
Total connected domination game
Csilla Bujtás, Michael A. Henning, Vesna Iršič +1
The (total) connected domination game on a graph is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirem…
The domination game played on diameter 2 graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
Let be the game domination number of a graph . It is proved that if , then $γ_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(…
On Rall's -conjecture on the domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
The -conjecture on the domination game asserts that if is a traceable graph, then the game domination number of is at most $\left\lceil \frac{n(G)}{2} \right\…
Z-domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
The Z-domination game is a variant of the domination game in which each newly selected vertex in the game must have a not yet dominated neighbor, but after the move all vertice…