Csilla Bujt'as

most citedMaker-Breaker domination game on trees when Staller wins

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023

The robust chromatic number of certain graph classes

Gábor Bacsó, Csilla Bujtás, Balázs Patkós +2

A 1-selection $f$ of a graph $G$ is a function $f : V (G) \to E (G)$ such that $f (v)$ is incident to $v$ for every vertex $v$ . The 1-removed $G_{f}$ is the graph $(V(G),E(G)\setm…

math.CO2023

Computational complexity aspects of super domination

Csilla Bujtás, Nima Ghanbari, Sandi Klavžar

Let $G$ be a graph. A dominating set $D \subseteq V (G)$ is a super dominating set if for every vertex $x \in V (G) ∖ D$ there exists $y \in D$ such that $N_G(y)\cap (V(G)\setmi…

math.CO2022★ 2 cited

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 $G$ , Dominator's goal is to select a dominating set and Staller's goal is to claim a closed neighborhood of some vertex. We s…