Pages that link to "Item:Q976106"
From MaRDI portal
The following pages link to Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106):
Displaying 23 items.
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- On maximum independent sets in \(P_{5}\)-free graphs (Q708334) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- Some results on graphs without long induced paths (Q1029004) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- Stability number in subclasses of \(P_5\)-free graphs (Q1764380) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- On mirror nodes in graphs without long induced paths (Q2869308) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs (Q5405918) (← links)
