2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
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…