The following pages link to (Q4634386):
Displaying 6 items.
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- (Q5009468) (← links)
