Pages that link to "Item:Q2369003"
From MaRDI portal
The following pages link to On the \(k\)-path cover problem for cacti (Q2369003):
Displaying 8 items.
- Hamiltonian laceability of bubble-sort graphs with edge faults (Q881895) (← links)
- Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
- Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
- The Steiner cycle and path cover problem on interval graphs (Q2075469) (← links)
- How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem (Q2245689) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- (Q4691777) (← links)