29 citations · 72 across the 26 of their papers we have counts for
6 papers · 1 filter
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…
Forbidding rank-preserving copies of a poset
Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2
The maximum size, , of a family of subsets of without containing a copy of as a subposet, has been intensively studied. Let be a graded poset.…
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…
Forbidden subposet problems for traces of set families
Dániel Gerbner, Balázs Patkós, Máté Vizer
In this paper we introduce a problem that bridges forbidden subposet and forbidden subconfiguration problems. The sets form a copy of a poset , if there…
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…
Generalized forbidden subposet problems
Daniel Gerbner, Balazs Keszegh, Balazs Patkos
A subfamily of sets is a copy of a poset in if there exists a bijection such…