Pages that link to "Item:Q2062685"
From MaRDI portal
The following pages link to Packing trees in complete bipartite graphs (Q2062685):
Displaying 11 items.
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Packing trees in complete graphs (Q1101132) (← links)
- On packing trees into complete bipartite graphs (Q1356567) (← links)
- Packing two copies of a tree into its fourth power (Q1970711) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- (Q3033795) (← links)
- Packingk-edge trees in graphs of restricted vertex degrees (Q3594953) (← links)
- Packing a tree with a graph of the same size (Q3691689) (← links)
- (Q4017048) (← links)
- Packing two forests into a bipartite graph (Q4894624) (← links)
- Packing four copies of a tree into a complete bipartite graph (Q5071592) (← links)