The following pages link to (Q3818327):
Displaying 7 items.
- Packing paths perfectly (Q757434) (← links)
- The path set packing problem (Q1790987) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- Uniform coverings of 2-paths by 4-paths (Q2760452) (← links)
- Ki-covers. II.Ki-perfect graphs (Q3472137) (← links)