Pages that link to "Item:Q659792"
From MaRDI portal
The following pages link to Packing three copies of a tree into a complete bipartite graph (Q659792):
Displaying 9 items.
- A note on packing two copies of a tree into a graph with small maximum degree (Q785787) (← links)
- A note on packing of three forests (Q1356715) (← links)
- Packing three trees (Q1916129) (← links)
- Packing trees in complete bipartite graphs (Q2062685) (← links)
- Packing three copies of a tree into its sixth power (Q2243090) (← links)
- Packing two copies of a tree into its third power (Q2433735) (← links)
- Packing two forests into a bipartite graph (Q4894624) (← links)
- Packing four copies of a tree into a complete bipartite graph (Q5071592) (← links)
- Placing two edge-disjoint copies of a tree into a bipartite graph (Q6105991) (← links)