167 citations · 211 across the 3 of their papers we have counts for
7 papers
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…
Dominating sequences in grid-like and toroidal graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5
A longest sequence of distinct vertices of a graph such that each vertex of dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…
-perfectly orientable -minor-free and outerplanar graphs
Boštjan Brešar, Tatiana Romina Hartinger, Tim Kos +1
A graph is said to be -perfectly orientable if it has an orientation such that for every vertex , the out-neighborhood of in is a clique in . In …
Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
Bostjan Bresar, Tanja Gologranc, Tim Kos
A sequence of distinct vertices of a graph is called a legal sequence if for any . The maximum l…
Domination game played on trees and spanning subgraphs
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
The domination game is played on a graph G. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G domin…
Minimum k-path vertex cover
Boštjan Brešar, František Kardoš, Ján Katrenič +1
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψ_k(G) the minimum cardinality of a…