Independent sets in extensions of 2K₂-free graphs
From MaRDI portal
Publication:1765375
Recommendations
- New results on independent sets in extensions of \(2K_2\)-free graphs
- A sufficient condition to extend polynomial results for the maximum independent set problem
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
- Maximum weight independent sets in classes related to claw-free graphs
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs
Cites work
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- A note on -redundant vertices in graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
- An upper bound on the number of cliques in a graph
- Augmenting chains in graphs without a skew star.
- Finding augmenting chains in extensions of claw-free graphs
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 861332 (Why is no real title available?)
- Independent domination in chordal graphs
- Independent domination in finitely defined classes of graphs
- On (\(P_{5}\), diamond)-free graphs
- On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
- On diameters and radii of bridged graphs
- On domination problems for permutation and other graphs
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- On extended P₄-reducible and extended P₄-sparse graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- On maximal independent sets of vertices in claw-free graphs
- On semi-\(P_ 4\)-sparse graphs
- On the stability number of claw-free \(P_5\)-free and more general graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- On variations of \(P_{4}\)-sparse graphs
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Stability in \(P_5\)- and banner-free graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
Cited in
(38)- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- Maximum weight independent set for claw-free graphs in polynomial time
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
- Sparse regular induced subgraphs in \(2P_3\)-free graphs
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- New results on independent sets in extensions of \(2K_2\)-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- On the complexity of the independent set problem in triangle graphs
- Independent domination versus weighted independent domination
- Counting edge-injective homomorphisms and matchings on restricted graph classes
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- From matchings to independent sets
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
- Independent Sets in Classes Related to Chair-Free Graphs
- The maximum weight stable set problem in (P₆, bull)-free graphs
- Induced separation dimension
- Tent and a subclass of \(P_{5}\)-free graphs
- A complexity dichotomy and a new boundary class for the dominating set problem
- Maximum weight independent sets in classes related to claw-free graphs
- A sufficient condition to extend polynomial results for the maximum independent set problem
- The Maximum Independent Set Problem in Planar Graphs
- The cluster deletion problem for cographs
- New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths
- Independent sets in graphs
- Critical hereditary graph classes: a survey
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- scientific article; zbMATH DE number 7742928 (Why is no real title available?)
- Max weight independent set in sparse graphs with no long claws
- Maximum regular induced subgraphs in 2P₃-free graphs
- On the maximum weighted irredundant set problem
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- Upper domination: towards a dichotomy through boundary properties
- The induced separation dimension of a graph
- A generalization of an independent set with application to (K_q; k)-stable graphs
- Polar graphs and maximal independent sets
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
This page was built for publication: Independent sets in extensions of 2\(K_{2}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765375)
