Pages that link to "Item:Q1356567"
From MaRDI portal
The following pages link to On packing trees into complete bipartite graphs (Q1356567):
Displaying 20 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Packing three copies of a tree into a complete bipartite graph (Q659792) (← links)
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture (Q914692) (← links)
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Packing trees in complete graphs (Q1101132) (← links)
- Two packing problems on \(k\)-matroid trees (Q1178033) (← links)
- A note on the ``packing of two copies of some trees into their third power'' (Q1431988) (← links)
- Packing trees into complete bipartite graphs (Q1946662) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Packing trees in complete bipartite graphs (Q2062685) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- (Q3033795) (← links)
- Packingk-edge trees in graphs of restricted vertex degrees (Q3594953) (← links)
- (Q4017048) (← links)
- Packing two bipartite graphs into a complete bipartite graph (Q4362090) (← links)
- Packing two forests into a bipartite graph (Q4894624) (← links)
- Packing four copies of a tree into a complete bipartite graph (Q5071592) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
