The Packing Coloring of Distance Graphs D(k,t) - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2014

The Packing Coloring of Distance Graphs D(k,t)

Jan Ekstein
  • Fonction : Auteur
kma
Premysl Holub
  • Fonction : Auteur
kma

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

Dates et versions

hal-00905732 , version 1 (18-11-2013)

Identifiants

Citer

Jan Ekstein, Premysl Holub, Olivier Togni. The Packing Coloring of Distance Graphs D(k,t). Discrete Applied Mathematics, 2014, 167, pp.100-106. ⟨10.1016/j.dam.2013.10.036⟩. ⟨hal-00905732⟩
84 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More