Recommendations
Cites work
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Bull-free Berge graphs are perfect
- Matching theory
- On a property of the class of n-colorable graphs
- On maximal independent sets of vertices in claw-free graphs
- Some simplified NP-complete graph problems
- Stability number of bull- and chair-free graphs
- The struction of a graph: Application to CN-free graphs
Cited in
(28)- A finiteness theorem for primal extensions
- On independent vertex sets in subclasses of apple-free graphs
- The Maximum Independent Set Problem in Planar Graphs
- On the use of Boolean methods for the computation of the stability number
- Extension of hereditary classes with substitutions
- The mixed vertex packing problem.
- Relaxations of vertex packing
- New applications of clique separator decomposition for the maximum weight stable set problem
- A nice class for the vertex packing problem
- Stability number of bull- and chair-free graphs
- scientific article; zbMATH DE number 1960287 (Why is no real title available?)
- Independent domination in finitely defined classes of graphs
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- New classes of Berge perfect graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- scientific article; zbMATH DE number 434914 (Why is no real title available?)
- Complexity of list coloring problems with a fixed total number of colors
- All minimal prime extensions of hereditary classes of graphs
- scientific article; zbMATH DE number 3943843 (Why is no real title available?)
- A class of web-based facets for the generalized vertex packing problem
- Portfolio optimization through a network approach: network assortative mixing and portfolio diversification
- scientific article; zbMATH DE number 3976364 (Why is no real title available?)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- Algorithm for the vertex packing problem
- On the structure of (pan, even hole)-free graphs
- Bounding the clique-width of \(H\)-free chordal graphs
- Stability number of bull- and chair-free graphs revisited
This page was built for publication: On the vertex packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366214)
