5 citations · 8 across the 12 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2017
On packing chromatic number of subcubic outerplanar graphs
Nicolas Gastineau, P{ř}emysl Holub, Olivier Togni
Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number i…
cs.DM2011
Packing Chromatic Number of Distance Graphs
Jan Ekstein, Přemysl Holub, Bernard Lidický
The packing chromatic number of a graph is the smallest integer such that vertices of can be partitioned into disjoint classes where vertices i…
cs.DM2010
The packing chromatic number of the square lattice is at least 12
Jan Ekstein, Jiří Fiala, Přemysl Holub +1
The packing chromatic number of a graph is the smallest integer such that the vertex set can be partitioned into disjoint classes , where ver…