Pages that link to "Item:Q1759813"
From MaRDI portal
The following pages link to On the \(k\)-path vertex cover of some graph products (Q1759813):
Displayed 22 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950) (← links)
- Uniformly dissociated graphs (Q4604516) (← links)
- (Q5225203) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← 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)