On independent vertex sets in subclasses of apple-free graphs
From MaRDI portal
(Redirected from Publication:848838)
Recommendations
- Independent Sets of Maximum Weight in Apple-Free Graphs
- Graphs without large apples and the maximum weight independent set problem
- Independent sets of maximum weight in apple-free graphs
- Maximum weight independent sets in classes related to claw-free graphs
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- A note on \(\alpha\)-redundant vertices in graphs
- Augmenting graphs for independent sets
- Decomposition by clique separators
- Efficient graph representations
- Graph Classes: A Survey
- Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
- Maximum independent sets in graphs of low degree
- Modular decomposition and transitive orientation
- New applications of clique separator decomposition for the maximum weight stable set problem
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- On Hamiltonicity of \{claw, net\}-free graphs
- On linear and circular structure of (claw, net)-free graphs
- On maximal independent sets of vertices in claw-free graphs
- On the vertex packing problem
- Robust algorithms for the stable set problem
- Stability in \(P_5\)- and banner-free graphs
- Stable sets in certain \(P_6\)-free graphs
- Stable sets in two subclasses of banner-free graphs
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- The ellipsoid method and its consequences in combinatorial optimization
- The strong perfect graph conjecture for pan-free graphs
- The strong perfect graph theorem
- The struction of a graph: Application to CN-free graphs
- The structure of claw-free graphs
Cited in
(13)- Maximum weight independent sets in hole- and co-chair-free graphs
- Set graphs. IV. Further connections with claw-freeness
- Graphs without large apples and the maximum weight independent set problem
- Combining decomposition approaches for the maximum weight stable set problem
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- Weighted independent sets in a subclass of P₆-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Independent sets of maximum weight in apple-free graphs
- Weighted efficient domination in two subclasses of P₆-free graphs
- On distance-3 matchings and induced matchings
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull
- Independent Sets of Maximum Weight in Apple-Free Graphs
This page was built for publication: On independent vertex sets in subclasses of apple-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848838)
