4 citations · 9 across the 9 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
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…