A note on packing of three forests
From MaRDI portal
The authors generalize the known result on the packing of three trees of maximal size into the complete graph \(K_n\) by presenting the complete result concerning the packing of three forests into \(K_n\).
Recommendations
- A note on the ``packing of two copies of some trees into their third power
- On the packing of three graphs
- scientific article; zbMATH DE number 731858
- Packing two copies of a tree into its third power
- Packing three copies of a tree into a complete graph
- Packing two forests into a bipartite graph
- On self-complementary cyclic packing of forests
- On the tree packing conjecture
- Packing three copies of a tree into a complete bipartite graph
- An approximate version of the tree packing conjecture
Cites work
- Edge disjoint placement of graphs
- Edge-disjoint placement of three trees
- Every (p,p-2) graph is contained in its complement
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 3943825 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3771651 (Why is no real title available?)
- scientific article; zbMATH DE number 3604921 (Why is no real title available?)
- Packing of graphs - a survey
- Packing three copies of a tree into a complete graph
- Packing three trees
- Packing trees in complete graphs
- Triple placement of graphs
Cited in
(3)
This page was built for publication: A note on packing of three forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356715)
