Packing two copies of a tree into its fourth power
type: Item
instance of: scholarly article
title: Packing two copies of a tree into its fourth power
zbMATH Open document ID: 0956.05080
DOI: 10.1016/S0012-365X(99)00177-6
author: H. Kheddouci
author: Mariusz Woźniak
author: Jean-François Saclé
published in: Discrete Mathematics
publication date: 2001-03-07T00:00:00Z
review text: Let \(G\) be a finite graph of order \(n\). An embedding of \(G\) is an edge-disjoint packing of two copies of \(G\) in the complete graph \(K_n\), in other terms, a packing of \(G\) in its complement. It is well known that a tree, which is not a star, is embeddable. The paper proves a stronger result, namely, that a tree \(T\) can be edge-disjointly packed in \(T^4\), the fourth power of \(T\).
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1420384
zbMATH Keywords: embedding
zbMATH Keywords: packing
reviewed by: Dietmar Cieslik
MaRDI profile type: Publication
full work available at URL: s0012-365x(99)00177-6
OpenAlex ID: W1972198857
description: scientific article; zbMATH DE number 1420384