Graph packing generally deals with unlabeled graphs. In [4], 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 [M.A. Tahraoui, E. Duchêne and H. Kheddouci, Labeled 2-packings of trees, Discrete Math. 338 (2015) 816-824] and cycles [E. Duchˆene, H. Kheddouci, R.J. Nowakowski and M.A. Tahraoui, Labeled packing of graphs, Australas. J. Combin. 57 (2013) 109-126]. In this note, we present a lower bound on the labeled packing number of any (n, n − 2)-graph into Kn. This result improves the bound given by Woźniak in [Embedding graphs of small size, Discrete Appl. Math. 51 (1994) 233-241].
@article{bwmeta1.element.doi-10_7151_dmgt_1977,
author = {M.-A. Tahraoui and E. Duch\^ene and H. Kheddouci},
title = {Labeled Embedding Of (n, n-2)-Graphs In Their Complements},
journal = {Discussiones Mathematicae Graph Theory},
volume = {37},
year = {2017},
pages = {1015-1025},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1977}
}
M.-A. Tahraoui; E. Duchêne; H. Kheddouci. Labeled Embedding Of (n, n-2)-Graphs In Their Complements. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 1015-1025. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1977/