Labeled packing of graphs

Eric Duchene 1 Hamamache Kheddouci 1 Richard Nowakowski Mohammed Amin Tahraoui 1
1 GrAMA - Graphes, Algorithmes et Multi-Agents
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In this talk, we will present a recent variant of the graph embedding problem on labeled graphs. Given a graph G=(V,E), a k-labeled embedding of G is a vertex labeling of G with k colors such that there exists an edge-disjoint placement of two copies of G into the complete graph $K_|V|$, preserving the labeling function. The objective is the maximization of the parameter k. We will present upper bounds in the general case, exact values for some families of graphs, and extensions for the placement of more than two copies of G.
Type de document :
Communication dans un congrès
SIAM conference in Discrete Mathematics, Jun 2012, Dalhousie University, Halifax, Canada. pp.1, 2012
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01353180
Contributeur : Équipe Gestionnaire Des Publications Si Liris <>
Soumis le : mercredi 10 août 2016 - 16:25:46
Dernière modification le : jeudi 19 avril 2018 - 14:38:04

Identifiants

  • HAL Id : hal-01353180, version 1

Citation

Eric Duchene, Hamamache Kheddouci, Richard Nowakowski, Mohammed Amin Tahraoui. Labeled packing of graphs. SIAM conference in Discrete Mathematics, Jun 2012, Dalhousie University, Halifax, Canada. pp.1, 2012. 〈hal-01353180〉

Partager

Métriques

Consultations de la notice

174