The following pages link to On F-independence in graphs (Q3559385):
Displaying 16 items.
- Augmenting approach for some maximum set problems (Q284765) (← links)
- On the weighted \(k\)-path vertex cover problem (Q406316) (← 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)
- Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs (Q1727753) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- The \(k\)-path vertex cover of rooted product graphs (Q2348061) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← 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)
- (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)
- Relating the independence number and the dissociation number (Q6094030) (← links)
