Csilla Bujt'as

collaborators

9 papers

math.CO2025

Thresholds for the biased Maker-Breaker domination games

BoÅ¡tjan BreÅ¡ar, Csilla BujtÃ¡s, Pakanun Dokyeesun +1

In the $(a, b)$ -biased Maker-Breaker domination game, two players alternately select unplayed vertices in a graph $G$ such that Dominator selects $a$ and Staller selects $b$ vertice…

math.CO2025

On $d$ -distance $p$ -packing domination number in strong products

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

The $d$ -distance $p$ -packing domination number $Î³_d^p(G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$ -distance dominating set and a…

math.CO2025

The $d$ -distance $p$ -packing domination number: complexity, cycles, and trees

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

A set of vertices $X \subseteq V (G)$ is a $d$ -distance dominating set if for every $u \in V (G) ∖ X$ there exists $x \in X$ such that $d (u, x) \leq d$ , and $X$ is a $p$ -packing if…

math.CO2025

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs

Csilla BujtÃ¡s, Vesna IrÅ¡iÄ Chenoweth, Sandi KlavÅ¾ar +1

The $d$ -distance $p$ -packing domination number $Î³_d^p(G)$ of $G$ is the minimum size of a set of vertices of $G$ which is both a $d$ -distance dominating set and a $p$ -packing. In…

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.CO2025

S-packing chromatic critical graphs

GÃ¼lnaz BoruzanlÄ± Ekinci, Csilla BujtÃ¡s, Didem GÃ¶zÃ¼pek +1

For a non-decreasing sequence of positive integers $S = (s_{1}, s_{2}, \dots)$ , the $S$ -packing chromatic number of a graph $G$ is denoted by $I ¨ _{S} (G)$ . In this paper, $I ¨ _{S}$ -critical gra…

Thresholds for the biased Maker-Breaker domination games

On d-distance p-packing domination number in strong products

The d-distance p-packing domination number: complexity, cycles, and trees

Revisiting d-distance (independent) domination in trees and in bipartite graphs

Visibility in graphs under edge and vertex removal

S-packing chromatic critical graphs

On $d$ -distance $p$ -packing domination number in strong products

The $d$ -distance $p$ -packing domination number: complexity, cycles, and trees

Revisiting $d$ -distance (independent) domination in trees and in bipartite graphs