On packing trees into complete bipartite graphs

DOI10.1016/S0012-365X(96)00014-3MaRDI QIDQ1356567zbMATH OpenOpenAlexFDO

Authors Raphael Yuster

Publication date 24 September 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(96)00014-3

zbMATH Keywords

packingsequence of trees

Mathematics Subject Classification ID

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

Recommendations

• Packing Trees into the Complete Graph
• A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
• Packing trees into complete bipartite graphs
• Packing trees in complete graphs

Cites work

• scientific article; zbMATH DE number 3604921 (Why is no real title available?)
• A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
• Packing trees in complete graphs
• Some remarks on packing trees

Cited in

(20)

• Packing a number of copies of a \(( p , q )\)-graph
• Packing branchings under cardinality constraints on their root sets
• An approximate version of the tree packing conjecture
• Packingk-edge trees in graphs of restricted vertex degrees
• Tree decompositions of graphs without large bipartite holes
• On self-complementary cyclic packing of forests
• Packing trees into complete bipartite graphs
• A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
• scientific article; zbMATH DE number 4132205 (Why is no real title available?)
• Packing three copies of a tree into its sixth power
• scientific article; zbMATH DE number 89770 (Why is no real title available?)
• Packing trees in complete graphs
• scientific article; zbMATH DE number 3889575 (Why is no real title available?)
• Two packing problems on \(k\)-matroid trees
• Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
• Packing trees in complete bipartite graphs
• Packing Trees into the Complete Graph
• A note on the ``packing of two copies of some trees into their third power
• Packing three copies of a tree into a complete bipartite graph
• Packing four copies of a tree into a complete bipartite graph

This page was built for publication: On packing trees into complete bipartite graphs

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