Csilla Bujt'as

activity

20152021

most cited

1/2

-conjectures on the domination game and claw-free graphs

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

collaborators

Showing 2019Show all

4 papers · 1 filter

math.CO2019

Domination number of graphs with minimum degree five

Csilla Bujtás

We prove that for every graph $G$ on $n$ vertices and with minimum degree five, the domination number $γ (G)$ cannot exceed $n /3$ . The proof combines an algorithmic approach and the…

math.CO2019

Perfect graphs for domination games

Csilla Bujtás, Vesna Iršič, Sandi Klavžar

Let $γ_{g} (G)$ and $γ_{t g} (G)$ be the game domination number and the total game domination number of a graph $G$ , respectively. Then $G$ is $γ_{g}$ -perfect (resp. $γ_{t g}$ -perfect), if…

math.CO2019

On the equality of domination number and $2$ -domination number

Gülnaz Boruzanlı Ekinci, Csilla Bujtás

The 2-domination number $γ_{2} (G)$ of a graph $G$ is the minimum cardinality of a set $D \subseteq V (G)$ for which every vertex outside $D$ is adjacent to at least two vertices i…

math.CO2019

On specific factors in graphs

Csilla Bujtás, Stanislav Jendrol, Zsolt Tuza

It is well known that if $G = (V, E)$ } is a multigraph and $X \subset V$ is a subset of even order, then $G$ contains a spanning forest $H$ such that each vertex from $X$ has an odd…

Domination number of graphs with minimum degree five

Perfect graphs for domination games

On the equality of domination number and 2-domination number

On specific factors in graphs

On the equality of domination number and $2$ -domination number