Packing a tree with a graph of the same size
From MaRDI portal
Recommendations
Cited in
(23)- Two theorems on packings of graphs
- Packing trees in complete graphs
- Symmetric edge-decompositions of hypercubes
- On packing bipartite graphs
- Packing graphs in their complements
- Packing of graphs - a survey
- Packing a tree of order p with a (p,p+1)-graph
- The Erdős-Sós conjecture for graphs whose complements contain no C₄
- Packing two copies of a tree into its fourth power
- On the Erdős-Sós conjecture for graphs with circumference at most k+1
- Packing three copies of a tree into its sixth power
- On Erdős-Sós conjecture for trees of large size
- Packing two copies of a sparse graph into a graph with restrained maximum degree
- scientific article; zbMATH DE number 3924795 (Why is no real title available?)
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
- The Erdős-Sós conjecture for spiders of large size
- A sufficient degree condition for a graph to contain all trees of size k
- scientific article; zbMATH DE number 2192134 (Why is no real title available?)
- My top 10 graph theory conjectures and open problems
- A Spectral Erdős-Sós Theorem
- An \(A_{\alpha}\)-spectral Erdős-Sós theorem
- A spectral Turán problem for a fixed tree
- Packing two graphs of order n having total size at most 2n-2
This page was built for publication: Packing a tree with a graph of the same size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691689)
