Pages that link to "Item:Q2192977"

The following pages link to A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977):

Displaying 7 items.

• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
• Complexity of the maximum \(k\)-path vertex cover problem (Q1641128) (← links)
• On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
• The geodesic-transversal problem (Q2246468) (← links)
• Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
• The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
• On the minimum vertex \(k\)-path cover of trees (Q2831594) (← links)