The following pages link to Resolvable path designs (Q1070250):
Displaying 21 items.
- On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites (Q394230) (← links)
- Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (Q397162) (← links)
- P\({}_ 3\)-factorization of complete multipartite graphs (Q920114) (← links)
- Existence of resolvable path designs (Q923105) (← links)
- On resolvable mixed path designs (Q923106) (← links)
- Optical grooming with grooming ratio eight (Q967318) (← links)
- Resolvable tree designs (Q1200005) (← links)
- Sub-Latin squares and incomplete orthogonal arrays (Q1213866) (← links)
- \(P_3\)-factorization of complete multipartite graphs (Q1288299) (← 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)
- Orthogonal starters in finite abelian groups (Q1812866) (← 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)
- Resolvable designs for resolving disputes (Q2747188) (← links)
- The Wide Trail Design Strategy (Q4550270) (← links)
- (Q5000307) (← links)
- Block colourings of star systems (Q6041533) (← links)
- Scheduling to reduce close contacts: resolvable grid graph decomposition and packing (Q6070358) (← links)
- Uniformly resolvable \({P_4, C_k}\)-decomposition of \(K_n\) -- a complete solution (Q6641088) (← links)
