Csilla Bujtás

activity

20132026

most citedDomination game on forests

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

collaborators

Showing math.COShow all

25 papers · 1 filter

math.CO2026

Majority C-coloring in Cartesian products

Csilla Bujtás, Magda Dettlaff, Hanna Furmańczyk +2

A majority C-coloring of a graph $G$ assigns colors to the vertices such that every vertex shares its color with at least half of its neighbors. The maximum number of colors that c…

math.CO2026

Majority C-coloring of graphs

Csilla Bujtas, Magda Dettlaff, Hanna Furmanczyk +1

Inspired by the majority colorings and C-colorings, we introduce and study the majority C-coloring of graphs. In such a vertex coloring, every vertex shares its color with at least…

math.CO2023

Partial domination in supercubic graphs

Csilla Bujtás andMichael A. Henning, Sandi Klavžar

For some $α$ with $0 < α \leq 1$ , a subset $X$ of vertices in a graph $G$ of order~ $n$ is an $α$ -partial dominating set of $G$ if the set $X$ dominates at least $α \times n$ vertices…

math.CO2020

Complex uniformly resolvable decompositions of $K_{v}$

Csilla Bujtàs, Mario Gionfriddo, Elena Guardo +3

In this paper we consider the complex uniformly resolvable decompositions of the complete graph $K_{v}$ into subgraphs such that each resolution class contains only blocks isomorphic…

math.CO2019

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 $u$ in the game must have a not yet dominated neighbor, but after the move all vertice…

math.CO2018

Partition-crossing hypergraphs

Csilla Bujtás, Zsolt Tuza

For a finite set $X$ , we say that a set $H \subseteq X$ crosses a partition $P = (X_{1}, \dots, X_{k})$ of $X$ if $H$ intersects $min (∣ H ∣, k)$ partition classes. If $∣ H ∣ \geq k$ , thi…

math.CO2017

On Grundy total domination number in product graphs

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6

A longest sequence $(v_{1}, \dots, v_{k})$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$ , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…

math.CO2017

Domination game on uniform hypergraphs

Csilla Bujtás, Balázs Patkós, Zsolt Tuza +1

In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $H$ by two players, namely Dominator and Staller, who alternately…

math.CO2017★ 1 cited

On the game total domination number

Csilla Bujtás

The total domination game is a two-person competitive optimization game, where the players, Dominator and Staller, alternately select vertices of an isolate-free graph $G$ . Each ve…

math.CO2017★ 2 cited

Grundy dominating sequences and zero forcing sets

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5

In a graph $G$ a sequence $v_{1}, v_{2}, \dots, v_{m}$ of vertices is Grundy dominating if for all $2 \leq i \leq m$ we have $N [v_{i}] \neq \subseteq \cup_{j = 1}^{i - 1} N [v_{j}]$ and is Grundy total do…

math.CO2016

Bounds on the 2-domination number

Csilla Bujtás, Szilárd Jaskó

In a graph $G$ , a set $D \subseteq V (G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$ . The 2-domination number $γ_{2} (G)$ is the minimum card…

math.CO2016

Clique Coverings and Claw-free Graphs

Csilla Bujtás, Akbar Davoodi, Ervin Győri +1

Let $C$ be a clique covering for $E (G)$ and let $v$ be a vertex of $G$ . The valency of vertex $v$ (with respect to $C$ ), denoted by $v a l_{C} (v)$ , is the number of cl…

math.CO2016

Dominating sequences in grid-like and toroidal graphs

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5

A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…

math.CO2016

The minimum number of vertices in uniform hypergraphs with given domination number

Csilla Bujtás, Balázs Patkós, Zsolt Tuza +1

The \textit{domination number} $γ (H)$ of a hypergraph $H = (V (H), E (H)$ is the minimum size of a subset $D \subset V (H$ of the vertice…

math.CO2016

Bounds on the Game Transversal Number in Hypergraphs

Csilla Bujtás, Michael A. Henning, Zsolt Tuza

Let $H = (V, E)$ be a hypergraph with vertex set $V$ and edge set $E$ of order $\nH = |V|$ and size $\mH = |E|$. A transversal in $H$ is a subset of vertices in $H$ that has a nonem…

math.CO2015★ 2 cited

$F$ -WORM colorings: Results for 2-connected graphs

Csilla Bujtás, Zsolt Tuza

Given two graphs $F$ and $G$ , an $F$ -WORM coloring of $G$ is an assignment of colors to its vertices in such a way that no $F$ -subgraph of $G$ is monochromatic or rainbow. If $G$ h…

math.CO2015

$K_{3}$ -WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum

Csilla Bujtás, Zsolt Tuza

A $K_{3}$ -WORM coloring of a graph $G$ is an assignment of colors to the vertices in such a way that the vertices of each $K_{3}$ -subgraph of $G$ get precisely two colors. We study gra…

math.CO2014★ 1 cited

The Disjoint Domination Game

Csilla Bujtás, Zsolt Tuza

We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker…

math.CO2014

Improved upper bounds on the domination number of graphs with minimum degree at least five

Csilla Bujtás, Sandi Klavžar

An algorithmic upper bound on the domination number $γ$ of graphs in terms of the order $n$ and the minimum degree $δ$ is proved. It is demonstrated that the bound improves best pr…

math.CO2014★ 1 cited

Induced cycles in triangle graphs

Aparna Lakshmanan S., Csilla Bujtás, Zsolt Tuza

The triangle graph of a graph $G$ , denoted by $T (G)$ , is the graph whose vertices represent the triangles ( $K_{3}$ subgraphs) of $G$ , and two vertices of $T (G)$ are adj…

math.CO2014★ 2 cited

On the game domination number of graphs with given minimum degree

Csilla Bujtás

In the domination game, introduced by Brešar, Klavžar and Rall in 2010, Dominator and Staller alternately select a vertex of a graph $G$ . A move is legal if the selected vertex $v$ …

math.CO2014★ 3 cited

Domination game on forests

Csilla Bujtás

In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph $G$ and take it into a set $D$ . The number of vertices dominated by the set $D$ mu…

math.CO2013

Approximability of the upper chromatic number of hypergraphs

Csilla Bujtás, Zsolt Tuza

A C-coloring of a hypergraph $H = (X, E)$ is a vertex coloring $φ : X \to N$ such that each edge $E \in E$ has at least two vertices with a common color. T…

math.CO2013

Total Transversals and Total Domination in Uniform Hypergraphs

Csilla Bujtás, Michael A. Henning, Zsolt Tuza +1

The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this…

Majority C-coloring in Cartesian products

Majority C-coloring of graphs

Partial domination in supercubic graphs

Complex uniformly resolvable decompositions of Kv​

Z-domination game

Partition-crossing hypergraphs

On Grundy total domination number in product graphs

Domination game on uniform hypergraphs

On the game total domination number

Grundy dominating sequences and zero forcing sets

Bounds on the 2-domination number

Clique Coverings and Claw-free Graphs

Dominating sequences in grid-like and toroidal graphs

The minimum number of vertices in uniform hypergraphs with given domination number

Bounds on the Game Transversal Number in Hypergraphs

F-WORM colorings: Results for 2-connected graphs

K3​-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum

The Disjoint Domination Game

Improved upper bounds on the domination number of graphs with minimum degree at least five

Induced cycles in triangle graphs

On the game domination number of graphs with given minimum degree

Domination game on forests

Approximability of the upper chromatic number of hypergraphs

Total Transversals and Total Domination in Uniform Hypergraphs

Complex uniformly resolvable decompositions of $K_{v}$

$F$ -WORM colorings: Results for 2-connected graphs

$K_{3}$ -WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum