Pages that link to "Item:Q1208469"
From MaRDI portal
The following pages link to Stability number of bull- and chair-free graphs (Q1208469):
Displaying 22 items.
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- The maximum clique problem (Q1318271) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- Struction revisited (Q1414580) (← links)
- Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Polynomially solvable cases for the maximum stable set problem (Q1894362) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- On the vertex packing problem (Q2366214) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Augmenting chains in graphs without a skew star. (Q2490836) (← links)
