Packing trees in complete graphs
type: Item
instance of: scholarly article
title: Packing trees in complete graphs
zbMATH Open document ID: 0642.05043
DOI: 10.1016/0012-365X(87)90164-6
author: Arthur M. Hobbs
author: Brian A. Bourgeois
author: Jothi Kasiraj
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: Trees \(T_ 1,T_ 2,...,T_ k\) are said to pack into \(K_ n\) if the edge-set of \(K_ n\) can be partitioned into \(k+1\) subgraphs of which k are isomorphic to \(T_ 1,T_ 2,...,T_ k\). A number of results are proved about when such packings are possible. For example, three trees of different orders can be thus packed, as can a set \(T_ 2,T_ 3,...,T_ n\) when each \(T_ i\) has order i and at most one \(T_ i\) has diameter greater than three.
reviewed by: Benjamin McKay
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 4045792
zbMATH Keywords: tree packing
zbMATH Keywords: graph decomposition
MaRDI profile type: Publication
cites work: Q4187840
cites work: Packings of graphs and applications to computational complexity
cites work: Balanced integer arrays: a matrix packing theorem
cites work: Q4170743
cites work: Q3947697
cites work: Packing a tree with a graph of the same size
cites work: Q3919751
cites work: Q4186364
full work available at URL: 0012-365x(87)90164-6
OpenAlex ID: W2008161614
Recommended article: Packing Trees into the Complete Graph
Recommended article: Packing trees in complete bipartite graphs
Recommended article: Packing trees into complete bipartite graphs
Recommended article: On packing trees into complete bipartite graphs
Recommended article: Q3797225
Recommended article: Q3980556
Recommended article: Q5074393
Recommended article: Packing and decomposition of graphs with trees
Recommended article: Q5294918
Recommended article: Packing trees into planar graphs
description: scientific article; zbMATH DE number 4045792