Csilla Bujt'as

most citedVisibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets

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

collaborators

9 papers

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★ 1 cited

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 1…

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 $χ_{S} (G)$ . In this paper, $χ_{S}$ -critical graph…

math.CO2025

Paired domination in graphs with minimum degree four

Csilla Bujtás, Michael A. Henning

A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ admits a perfect matching. The…

math.CO2025

Criticality for Maker-Breaker domination games with predomination

Csilla Bujtás, Pakanun Dokyeesun, Sandi Klavžar +1

A predominated graph is a pair $(G, D)$ , where $G$ is a graph and the vertices in $D \subseteq V (G)$ are considered already dominated. Maker-Breaker domination game critical (MBD cri…

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.CO2024★ 1 cited

Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets

Csilla Bujtás, Sandi Klavžar, Jing Tian

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the…

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

Paired domination in graphs with minimum degree four

Criticality for Maker-Breaker domination games with predomination

Thresholds for the biased Maker-Breaker domination games

Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets

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