The following pages link to (Q5005166):
Displaying 4 items.
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
