Labeled packing of graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Labeled packing of graphs

Résumé

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

Dates et versions

hal-01353180 , version 1 (10-08-2016)

Identifiants

  • HAL Id : hal-01353180 , version 1

Citer

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. ⟨hal-01353180⟩
128 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More