Pages that link to "Item:Q923105"
From MaRDI portal
The following pages link to Existence of resolvable path designs (Q923105):
Displayed 12 items.
- Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (Q397162) (← links)
- On resolvable mixed path designs (Q923106) (← links)
- Nesting directed cycle systems of even length (Q1193557) (← links)
- Resolvable tree designs (Q1200005) (← links)
- Path factorizations of complete multipartite graphs (Q1296982) (← links)
- On path factorizations of complete multipartite graphs (Q1313872) (← links)
- \(G\)-designs and related designs (Q1802138) (← links)
- On the chromatic index of path decompositions (Q1876679) (← links)
- Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices (Q2515559) (← links)
- A survey on the existence of<i>G</i>-Designs (Q3528164) (← links)
- Almost resolvable <i>P</i><sub><i>k</i></sub>‐decompositions of complete graphs (Q3984462) (← links)
- On tree factorizations of <i>K<sub>n</sub></i> (Q4285593) (← links)