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 2016Show all

5 papers · 1 filter

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…