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

M.-A. Tahraoui; E. Duchêne; H. Kheddouci

Discussiones Mathematicae Graph Theory (2017)

  • Volume: 37, Issue: 4, page 1015-1025
  • ISSN: 2083-5892

Abstract

top
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].

How to cite

top

M.-A. Tahraoui, E. Duchêne, and H. Kheddouci. "Labeled Embedding Of (n, n-2)-Graphs In Their Complements." Discussiones Mathematicae Graph Theory 37.4 (2017): 1015-1025. <http://eudml.org/doc/288392>.

@article{M2017,
abstract = {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].},
author = {M.-A. Tahraoui, E. Duchêne, H. Kheddouci},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {packing of graphs; labeled packing; permutation},
language = {eng},
number = {4},
pages = {1015-1025},
title = {Labeled Embedding Of (n, n-2)-Graphs In Their Complements},
url = {http://eudml.org/doc/288392},
volume = {37},
year = {2017},
}

TY - JOUR
AU - M.-A. Tahraoui
AU - E. Duchêne
AU - H. Kheddouci
TI - Labeled Embedding Of (n, n-2)-Graphs In Their Complements
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 4
SP - 1015
EP - 1025
AB - 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].
LA - eng
KW - packing of graphs; labeled packing; permutation
UR - http://eudml.org/doc/288392
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.