- Tytuł:
- Labeled Embedding Of (n, n-2)-Graphs In Their Complements
- Autorzy:
-
Tahraoui, M.-A.
Duchêne, E.
Kheddouci, H. - Powiązania:
- https://bibliotekanauki.pl/articles/31341583.pdf
- Data publikacji:
- 2017-11-27
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
packing of graphs
labeled packing
permutation - Opis:
- 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].
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 4; 1015-1025
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł