Packing four copies of a tree into a complete graph

MaRDI QIDQ2876050zbMATH OpenFDO

Authors Sean P. Haler, Hong Wang

Publication date 15 August 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au/pdf/59/ajc_v59_p323.pdf

zbMATH Keywords

\(k\)-placeable trees

Mathematics Subject Classification ID

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

Recommendations

• Packing two copies of a tree into its third power
• Packing three copies of a tree into a complete graph
• A note on k-placeable graphs
• Edge-disjoint placement of three trees
• Packing a number of copies of a \(( p , q )\)-graph

Cited in

(11)

• Packing trees in complete bipartite graphs
• Packing a number of copies of a \(( p , q )\)-graph
• Packing two copies of a tree into its third power
• 4-placement of rooted trees
• scientific article; zbMATH DE number 3871397 (Why is no real title available?)
• A note on k-placeable graphs
• Remarks on the placeability of isomorphic trees in a complete graph
• Packing four copies of a tree into a complete bipartite graph
• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Three edge-disjoint plane spanning paths in a point set
• Three edge-disjoint plane spanning paths in a point set

This page was built for publication: Packing four 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 Q2876050)