Labeled Embedding Of (n, n-2)-Graphs In Their Complements

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, Discre...

Full description

Saved in:
Bibliographic Details
Published inDiscussiones Mathematicae. Graph Theory Vol. 37; no. 4; pp. 1015 - 1025
Main Authors Tahraoui, M.-A., Duchêne, E., Kheddouci, H.
Format Journal Article
LanguageEnglish
Published De Gruyter Open 01.01.2017
University of Zielona Góra
Subjects
Combinatorics
Computational Complexity
Computer Science
labeled packing
Mathematics
packing of graphs
permutation
Packing of graphs
Permutation
Labeled packing
Online AccessGet full text

Cover

More Information
Summary: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].
ISSN:1234-3099
2083-5892
DOI:10.7151/dmgt.1977