3 citations · 6 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
Total dominating sequences in trees, split graphs, and under modular decomposition
Boštjan Brešar, Tim Kos, Graciela Nasini +1
A sequence of vertices in a graph with no isolated vertices is called a total dominating sequence if every vertex in the sequence totally dominates at least one vertex that was…
math.CO2016
Shifts of the Stable Kneser Graphs and Hom-Idempotence
Pablo Torres, Mario Valencia-Pabon
A graph is said to be {\em hom-idempotent} if there is a homomorphism from to , and {\em weakly hom-idempotent} if for some there is a homomorphism from $G^…