The Packing Coloring of Distance Graphs D(k,t)
Résumé
The packing chromatic number χρ(G) of a graph G is the smallest integer p such that vertices of G can be partitioned into disjoint classes X1,...,Xp where vertices in Xi have pairwise distance between them greater than i. For k
Domaines
Mathématique discrète [cs.DM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|