Sum coloring of distance and circulant graphs

Abstract : A distance graph (resp. circulant graph) is a graph obtained from the path (resp. the cycle) of order n by adding chordal edges between any pair of vertices at distance d\in D, D\subseteq Zn. The chromatic sum of a graph is the smallest sum of colors among all proper colorings of this graph. This paper studies the chromatic sum for some classes of distance graphs and circulant graphs depending on the value of D.
Type de document :
Communication dans un congrès
7th International Colloquium on Graph Theory, 2005, Hyères, France. 22, pp.239-244, 2005
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00174206
Contributeur : Brice Effantin <>
Soumis le : vendredi 21 septembre 2007 - 17:20:57
Dernière modification le : mercredi 31 octobre 2018 - 12:24:09

Identifiants

  • HAL Id : hal-00174206, version 1

Collections

Citation

Brice Effantin, Hamamache Kheddouci. Sum coloring of distance and circulant graphs. 7th International Colloquium on Graph Theory, 2005, Hyères, France. 22, pp.239-244, 2005. 〈hal-00174206〉

Partager

Métriques

Consultations de la notice

80