Pages that link to "Item:Q2857407"
From MaRDI portal
The following pages link to Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\) (Q2857407):
Displaying 10 items.
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) (Q965963) (← links)
- A note on the tree decompositions of graphs (Q1387426) (← links)
- Packing and decomposition of graphs with trees (Q1569062) (← links)
- Perfect matchings and \(k\)-decomposability of increasing trees (Q2654607) (← links)
- Edge-decompositions of<i>K<sub>n,n</sub></i>into isomorphic copies of a given tree (Q3159387) (← links)
- The decomposition of trees into subtrees (Q3344008) (← links)
- On a Häggkvist's Conjecture with the Polynomial Method (Q3503519) (← links)
- Problem D. Froncek and M. Kubesa (Q3508852) (← links)
- (Q3976641) (← links)
- Tree decomposition of graphs (Q4240601) (← links)
