Pages that link to "Item:Q3984462"
From MaRDI portal
The following pages link to Almost resolvable <i>P</i><sub><i>k</i></sub>‐decompositions of complete graphs (Q3984462):
Displaying 7 items.
- Existence of resolvable path designs (Q923105) (← links)
- Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative (Q1587903) (← links)
- Solving a special case of the P conjecture using dependency graphs with dissolution (Q1749169) (← links)
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length (Q1825884) (← links)
- On the chromatic index of path decompositions (Q1876679) (← links)
- On resolvable tree-decompositions of complete graphs (Q3826613) (← links)
- Connected resolving decompositions in graphs (Q4429225) (← links)