4 citations · 9 across the 9 of their papers we have counts for
11 papers
Packing chromatic number versus chromatic and clique number
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 each is…
On well-covered Cartesian products
Bert L. Hartnell, Douglas F. Rall, Kirsti Wash
In 1970, Plummer defined a well-covered graph to be a graph in which all maximal independent sets are in fact maximum. Later Hartnell and Rall showed that if the Cartesian prod…
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 […
Spectral properties of the hierarchical product of graphs
Per Sebastian Skardal, Kirsti Wash
The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than…
On minimum identifying codes in some Cartesian product graphs
Douglas F. Rall, Kirsti Wash
An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The…