Labeled embedding of (n, n − 2)-graphs in their complements - Archive ouverte HAL Access content directly
Journal Articles Discussiones Mathematicae Graph Theory Year : 2017

Labeled embedding of (n, n − 2)-graphs in their complements

Abstract

Graph packing generally deals with unlabeled graphs. In a previous paper, 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 and cycles. In this note, we present a lower bound on the labeled packing number of any $(n,n-2)$-graph into K_n. This result improves the bound given by Wo\'zniak in 1994.
Fichier principal
Vignette du fichier
TDKW_v2 (1).pdf (122.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01518715 , version 1 (29-11-2017)

Identifiers

Cite

Mohammed Amin Tahraoui, Eric Duchene, Hamamache Kheddouci, Mariusz Wozniak. Labeled embedding of (n, n − 2)-graphs in their complements. Discussiones Mathematicae Graph Theory, 2017, ⟨10.7151/dmgt.1977⟩. ⟨hal-01518715⟩
266 View
133 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More