Abstract : 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
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00905732
Contributeur : Olivier Togni <>
Soumis le : lundi 18 novembre 2013 - 16:05:01 Dernière modification le : vendredi 17 juillet 2020 - 14:53:54