Pages that link to "Item:Q5384003"
From MaRDI portal
The following pages link to Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time (Q5384003):
Displayed 12 items.
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five (Q5854894) (← links)
- (Q5874504) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- (Q6078549) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6163958) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)