3 citations · 8 across the 5 of their papers we have counts for
5 papers
Domination in digraphs and their products
Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall
A dominating (respectively, total dominating) set of a digraph is a set of vertices in such that the union of the closed (respectively, open) out-neighborhoods of verti…
Graphs with a unique maximum open packing
Boštjan Brešar, Kirsti Kuenzel, Douglas F. Rall
A set of vertices in a graph is an open packing if (open) neighborhoods of any two distinct vertices in are disjoint. In this paper, we consider the graphs that have a uniq…
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…
Packing chromatic number under local changes in a graph
Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1
The packing chromatic number of a graph is the smallest integer such that there exists a -vertex coloring of in which any two vertices receiving color a…
Packing chromatic number, -colorings, and characterizing the Petersen graph
Boštjan Brešar, Sandi Klavžar, Douglas F. Rall +1
The packing chromatic number of a graph is the smallest integer such that the vertex set of can be partitioned into sets , where , $i\in […