Pages that link to "Item:Q2042202"
From MaRDI portal
The following pages link to Decomposition of complete graphs into arbitrary trees (Q2042202):
Displaying 17 items.
- Generation of trees of a graph with the use of decomposition (Q800368) (← links)
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963) (← links)
- Decomposing hypergraphs into simple hypertrees (Q1586356) (← links)
- Null decomposition of trees (Q1690257) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- Decomposition into two trees with orientation constraints (Q2339817) (← links)
- Decomposition of Cartesian products of regular graphs into isomorphic trees (Q2449976) (← links)
- Tree decompositions of multigraphs (Q2721877) (← links)
- (Q3012402) (← links)
- (Q3816106) (← links)
- On resolvable tree-decompositions of complete graphs (Q3826613) (← links)
- (Q4227946) (← links)
- (Q4873673) (← links)
- Decomposing almost complete graphs by random trees (Q5890651) (← links)
- Decomposing almost complete graphs by random trees (Q5915750) (← links)
- Tree decomposition (Q5955927) (← links)
- Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs (Q6558937) (← links)