Labeled embedding of (n, n − 2)-graphs in their complements
Résumé
Graph packing generally deals with unlabeled graphs. In a previous paper, the authors have introduced a new variant of the graph packing problem, called the labeled packing of a graph. This problem has recently been studied on trees and cycles. In this note, we present a lower bound on the labeled packing number of any $(n,n-2)$-graph into K_n. This result improves the bound given by Wo\'zniak in 1994.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|