Pages that link to "Item:Q1007592"
From MaRDI portal
The following pages link to Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592):
Displaying 8 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
