Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs

Jean-Luc Baril 1 Hamamache Kheddouci 2 Olivier Togni 1
1 Le2i - Laboratoire Electronique, Informatique et Image [UMR6303]
2 LIESP - Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production
Abstract : This paper studies edge- and total-colorings of graphs in which (all or only adjacent) vertices are distinguished by their sets of colors. We provide bounds for the minimum number of colors needed for such colorings for the Cartesian product of graphs along with exact results for generalized hypercubes. We also present general bounds for the direct, strong and lexicographic products.
Keywords : graph edge-coloring vertex-distinguishing adjacent vertex-distinguishing total coloring total adjacent vertex-distinguishing graph products
Type de document :
Article dans une revue
Ars Combinatoria, Waterloo, Ont : Dept. of Combinatorics and Optimization, University of Waterloo, 2012, 107, pp.109-127
Liste complète des métadonnées
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00762728
Contributeur : Olivier Togni <>
Soumis le : vendredi 7 décembre 2012 - 16:54:16
Dernière modification le : mercredi 12 septembre 2018 - 01:28:08

Identifiants

  • HAL Id : hal-00762728, version 1

Collections

UNIV-LYON2 | INSA-LYON | LIESP | LE2I | TDS-MACS | UNIV-LYON1 | EC-LYON | ICB | UNIV-HESAM

Citation

Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni. Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs. Ars Combinatoria, Waterloo, Ont : Dept. of Combinatorics and Optimization, University of Waterloo, 2012, 107, pp.109-127. 〈hal-00762728〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

257

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD