3 papers
math.CO2017
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…
math.CO2017
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…
math.CO2016
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…