The following pages link to (Q5075752):
Displaying 7 items.
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
