Packing almost stars into the complete graph
From MaRDI portal
Recommendations
Cited in
(22)- Generalizations of the tree packing conjecture
- Packing trees of unbounded degrees in random graphs
- Packing spanning graphs from separable families
- Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
- scientific article; zbMATH DE number 5999574 (Why is no real title available?)
- Packing graphs with odd and even trees
- Packing large trees of consecutive orders
- Packing minor-closed families of graphs into complete graphs
- Packing trees of bounded diameter into the complete graph
- Packing trees into complete bipartite graphs
- Packing trees into complete \(k\)-partite graph
- Packing paths in complete graphs
- Packing sequences
- On the tree packing conjecture
- Packing in honeycomb networks
- Domination in certain chemical graphs
- A special case of the tree packing conjecture
- Packing tree degree sequences
- Packing Trees into the Complete Graph
- Packing large balanced trees into bipartite graphs
- scientific article; zbMATH DE number 4145943 (Why is no real title available?)
- Packing trees with constraints on the leaf degree
This page was built for publication: Packing almost stars into the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344220)