Packing three copies of a tree into a complete graph

DOI10.1006/EUJC.1993.1018MaRDI QIDQ1209730zbMATHOpenAlexFDO

Authors Hong Wang, Norbert 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)

Recommendations

• Packing two copies of a tree into its third power
• Packing three copies of a tree into its sixth power
• Triple placement of graphs
• Remarks on the placeability of isomorphic trees in a complete graph
• Packing of three copies of a graph

Cited in

(15)

• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Remarks on the placeability of isomorphic trees in a complete graph
• Packing three trees
• Packing of three copies of a graph
• Packing four copies of a tree into a complete graph
• Packing two copies of a tree into its third power
• A note on packing of three forests
• Packing three copies of a tree into its sixth power
• Packing four copies of a tree into a complete bipartite graph
• Packing trees in complete bipartite graphs
• Packing of graphs and permutations -- a survey
• Packing a number of copies of a \(( p , q )\)-graph
• Packing trees into 1-planar graphs
• A note on the ``packing of two copies of some trees into their third power
• On uniqueness of packing of three copies of 2-factors

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

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