16 citations · 50 across the 58 of their papers we have counts for
4 papers · 2 filters
On Grundy total domination number in product graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6
A longest sequence of vertices of a graph is a Grundy total dominating sequence of if for all , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…
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 by two players, namely Dominator and Staller, who alternately…
A Note on the Polytope of Bipartite TSP
Gergely Kovács, Zsolt Tuza, Béla Vizvári +1
The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones…
Grundy dominating sequences and zero forcing sets
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5
In a graph a sequence of vertices is Grundy dominating if for all we have and is Grundy total do…