Labeled embedding of (n,n-2)-graphs in their complements
Discrete Mathematics
2014-11-03 v1 Combinatorics
Abstract
Graph packing generally deals with unlabeled graphs. In \cite{EHRT11}, the authors have introduced a new variant of the graph packing problem, called the \textit{labeled packing of a graph}. This problem has recently been studied on trees \cite{TDK13} and cycles \cite{EHRT11}. In this note, we present a lower bound on the labeled packing number of any -graph into . This result improves the bound given by Wo\'zniak in \cite{W94}.
Cite
@article{arxiv.1410.8694,
title = {Labeled embedding of (n,n-2)-graphs in their complements},
author = {M. A. Tahraoui and E. Duchene and H. Kheddouci and M. Wozniak},
journal= {arXiv preprint arXiv:1410.8694},
year = {2014}
}