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.