Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Ars Combinatoria Année : 2012

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-00762728 , version 1 (07-12-2012)

Identifiants

  • HAL Id : hal-00762728 , version 1

Citer

Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni. Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs. Ars Combinatoria, 2012, 107, pp.109-127. ⟨hal-00762728⟩
98 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More