The following pages link to On the vertex \(k\)-path cover (Q2446837):
Displaying 37 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← 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)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- Approximation algorithms for hitting subgraphs (Q2115875) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs (Q2333163) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)
- A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Uniformly dissociated graphs (Q4604516) (← links)
- General d-position sets (Q5013341) (← links)
- The k-Observer Problem on d-regular Graphs (Q5207902) (← 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)
- On the peel number and the leaf-height of Galton–Watson trees (Q5885185) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
- Relating the independence number and the dissociation number (Q6094030) (← links)
