Packing three copies of a tree into a complete graph

DOI10.1006/eujc.1993.1018zbMath0773.05084OpenAlexW1968315138MaRDI QIDQ1209730

Hong Wang, Norbert W. Sauer

Publication date: 16 May 1993

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

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

zbMATH Keywords

treepacking of graphs

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (10)

A note on packing of three forests ⋮ Packing three trees ⋮ Packing Trees into 1-planar Graphs ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Packing two copies of a tree into its third power ⋮ Packing of graphs and permutations -- a survey ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ A note on the ``packing of two copies of some trees into their third power ⋮ Packing three copies of a tree into its sixth power ⋮ Packing trees in complete bipartite graphs

This page was built for publication: Packing three copies of a tree into a complete graph