Circular chromatic numbers and fractional chromatic numbers of distance graphs
European Journal of Combinatorics
Coloring of integer distance graphs
Discrete Mathematics
Circular chromatic numbers of a class of distance graphs
Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
Discrete Applied Mathematics
The packing chromatic number of infinite product graphs
European Journal of Combinatorics
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics
Packing chromatic number of distance graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
The packing chromatic number @g"@r(G) of a graph G is the smallest integer p such that vertices of G can be partitioned into disjoint classes X"1,...,X"p where vertices in X"i have pairwise distance between them greater than i. For k