Pages that link to "Item:Q708334"
From MaRDI portal
The following pages link to On maximum independent sets in \(P_{5}\)-free graphs (Q708334):
Displaying 15 items.
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- 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)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- On mirror nodes in graphs without long induced paths (Q2869308) (← links)
- (Q3714112) (← links)
- Spectral properties of cographs and<i>P</i><sub>5</sub>-free graphs (Q4967261) (← 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)
