Distance-edge-coloring of trees

Abstract : For a given bounded nonnegative integer ℓ, an ℓ-distance-edge-coloring of a graph G = (V (G),E(G)) is a function from the edges E to colors {1, 2, · · · , k} such that any two edges within distance ℓ of each other are assigned different colors. In this paper, we propose an algorithm to compute the minimum value of k for trees.
Type de document :
Communication dans un congrès
International Network Optimization Conference, 2009, Pise, Italy. To appear, 2009
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00385082
Contributeur : Graphe Liesp Equipe <>
Soumis le : lundi 18 mai 2009 - 12:23:04
Dernière modification le : mercredi 31 octobre 2018 - 12:24:09

Identifiants

  • HAL Id : hal-00385082, version 1

Collections

Citation

Kaouther Drira, Hamida Seba, Hamamache Kheddouci. Distance-edge-coloring of trees. International Network Optimization Conference, 2009, Pise, Italy. To appear, 2009. 〈hal-00385082〉

Partager

Métriques

Consultations de la notice

59