Edge-disjoint placement of three trees

DOI10.1006/EUJC.1996.0047MaRDI QIDQ1922881zbMATH OpenOpenAlexFDO

Authors Mariusz Woźniak, Maryvonne Mahéo, Jean-François Saclé

Publication date 4 May 1997

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1996.0047

zbMATH Keywords

edge-disjoint placementpackingtrees

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

We say that there is a packing of \(G_1,\dots,G_k\) (into the complete graph \(K_n\)) if there exist injections \(\sigma_i:V(G_i)\to V(K_n)\), \(i=1,\dots,k\), such that \(\sigma^*_i(E(G_i))\cap\sigma^*_j(E(G_j))=\varnothing\) for \(i\neq j\), where the map \(\sigma^*_i:E(G_i)\to E(K_n)\) is the one induced by \(\sigma_i\). A packing of \(k\) copies of a graph \(G\) is called a \(k\)-placement of \(G\). This paper gives all the triples of trees of order \(n\) for which there is a packing into \(K_n\).

Recommendations

• Packing three trees
• Packing trees in complete graphs
• Packing three copies of a tree into a complete graph

Cited in

(10)

• A note on packing of three forests
• Packing three trees
• Packing three copies of a tree into its sixth power
• Packing four copies of a tree into a complete graph
• 4-placement of rooted trees
• Packing trees into planar graphs
• On the packing of two copies of a caterpillar in its third power
• Packing trees into 1-planar graphs
• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Planar packing of trees and spider trees

This page was built for publication: Edge-disjoint placement of three trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922881)