Szczegóły publikacji
Opis bibliograficzny
Labeled embedding of (n,n-2)-graphs in their complements / M.-A. Tahraoui, E. Duchêne, H. Kheddouci, M. WOŹNIAK // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2017 — vol. 37 iss. 4, s. 1015–1025. — Bibliogr. s. 1025, Abstr.
Autorzy (4)
- Tahraoui M. A.
- Duchêne E.
- Kheddouci Hamamache
- AGHWoźniak Mariusz
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 110010 |
|---|---|
| Data dodania do BaDAP | 2017-11-29 |
| Tekst źródłowy | URL |
| DOI | 10.7151/dmgt.1977 |
| Rok publikacji | 2017 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Discussiones Mathematicae, Graph Theory |
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].
