Pages that link to "Item:Q2348061"

The following pages link to The \(k\)-path vertex cover of rooted product graphs (Q2348061):

Displaying 13 items.

• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
• PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
• On the \(k\)-path vertex cover of some graph products (Q1759813) (← links)
• Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
• On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
• The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
• On the vertex \(k\)-path cover (Q2446837) (← links)
• Ascending graphoidal tree cover for product graphs (Q2831093) (← links)
• Spectra of M-rooted product of graphs (Q5023592) (← links)
• (Q5225203) (← links)
• 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
• Bounds on the Twin-Width of Product Graphs (Q6131799) (← links)