Packing three copies of a tree into a complete graph

DOI10.1006/EUJC.1993.1018zbMATH Open0773.05084OpenAlexW1968315138MaRDI QIDQ1209730FDOQ1209730

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

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

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)

Cited In (15)

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

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)