The following pages link to (Q5463498):
Displayed 38 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← 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)
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← 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)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Independent packings in structured graphs (Q2583122) (← 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)
- (Q4691867) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
- (Q4961733) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- General d-position sets (Q5013341) (← links)
- (Q5225203) (← links)
- 3-path vertex cover and dissociation number of hexagonal graphs (Q5866250) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
- A bound on the dissociation number (Q6047956) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
- Relating the independence number and the dissociation number (Q6094030) (← links)
- On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number (Q6178795) (← links)
- Extremal vertex-degree function index with given order and dissociation number (Q6184319) (← links)
- On spectral extrema of graphs with given order and dissociation number (Q6184344) (← links)