The following pages link to On the vertex packing problem (Q2366214):
Displaying 20 items.
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- All minimal prime extensions of hereditary classes of graphs (Q868943) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Stability number of bull- and chair-free graphs (Q1208469) (← links)
- New classes of Berge perfect graphs (Q1332433) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Extension of hereditary classes with substitutions (Q1811128) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- A finiteness theorem for primal extensions (Q2484373) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- Portfolio optimization through a network approach: network assortative mixing and portfolio diversification (Q6090171) (← links)
