Pages that link to "Item:Q1569062"
From MaRDI portal
The following pages link to Packing and decomposition of graphs with trees (Q1569062):
Displaying 8 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Minimum degree and minimum number of edge-disjoint trees (Q1420598) (← links)
- Clumsy packings of graphs (Q2001970) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- (Q2857407) (← links)
- Almost Every Tree With <i>m</i> Edges Decomposes <i>K</i><sub>2<i>m</i>,2<i>m</i></sub> (Q5414145) (← links)
- Decomposing almost complete graphs by random trees (Q5890651) (← links)
- Decomposing almost complete graphs by random trees (Q5915750) (← links)