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 2 items.

• On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
• The geodesic-transversal problem (Q2246468) (← links)