3 citations · 6 across the 8 of their papers we have counts for
14 papers
The k-path vertex cover: general bounds and chordal graphs
Csilla Bujtás, Marko Jakovac, Zsolt Tuza
For an integer , a -path vertex cover of a graph is a set that shares a vertex with every path subgraph of order in . The minimum cardina…
Predominating a vertex in the connected domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph.…
-conjectures on the domination game and claw-free graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
Let be the game domination number of a graph . Rall conjectured that if is a traceable graph, then . Our main re…
Total connected domination game
Csilla Bujtás, Michael A. Henning, Vesna Iršič +1
The (total) connected domination game on a graph is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirem…
The domination game played on diameter 2 graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
Let be the game domination number of a graph . It is proved that if , then $γ_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(…
On Rall's -conjecture on the domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
The -conjecture on the domination game asserts that if is a traceable graph, then the game domination number of is at most $\left\lceil \frac{n(G)}{2} \right\…
Bipartite graphs with close domination and k-domination numbers
Gülnaz Boruzanlı Ekinci, Csilla Bujtás
Let be a positive integer and let be a graph with vertex set . A subset is a -dominating set if every vertex outside is adjacent to at least…
General upper bound on the game domination number
Csilla Bujtás
It is conjectured that the game domination number is at most for every -vertex graph which does not contain isolated vertices. It was proved in the recent years that the…
Domination number of graphs with minimum degree five
Csilla Bujtás
We prove that for every graph on vertices and with minimum degree five, the domination number cannot exceed . The proof combines an algorithmic approach and the…
Perfect graphs for domination games
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
Let and be the game domination number and the total game domination number of a graph , respectively. Then is -perfect (resp. -perfect), if…
On the equality of domination number and -domination number
Gülnaz Boruzanlı Ekinci, Csilla Bujtás
The 2-domination number of a graph is the minimum cardinality of a set for which every vertex outside is adjacent to at least two vertices i…
On specific factors in graphs
Csilla Bujtás, Stanislav Jendrol, Zsolt Tuza
It is well known that if } is a multigraph and is a subset of even order, then contains a spanning forest such that each vertex from has an odd…
The variety of domination games
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
Domination game [SIAM J.\ Discrete Math.\ 24 (2010) 979--991] and total domination game [Graphs Combin.\ 31 (2015) 1453--1462] are by now well established games played on graphs by…
Transversal designs and induced decompositions of graphs
Csilla Bujtás, Zsolt Tuza
We prove that for every complete multipartite graph there exist very dense graphs on vertices, namely with as many as edges for all , for some co…