On maximal independent sets of vertices in claw-free graphs

Related Items

On claw-free asteroidal triple-free graphs, Edge-disjoint packings of graphs, An exact algorithm for the maximum stable set problem, Quelques utilisations de la STRUCTION. (Some applications of STRUCTION), Augmenting approach for some maximum set problems, Polynomial algorithms for the maximum stable set problem on particular classes of $P_{5}$-free graphs, On the feedback vertex set polytope of a series-parallel graph, Enumeration of maximal irredundant sets for claw-free graphs, Finding and counting small induced subgraphs efficiently, Weighted independent sets in classes of $P_6$-free graphs, On independent vertex sets in subclasses of apple-free graphs, The maximum independent set problem in subclasses of $S_{i, j, k}$-free graphs, The structure of well-covered graphs and the complexity of their recognition problems, Well-covered triangulations. IV, Claw-free graphs---a survey, Matching extension in $K_{1,r}$-free graphs with independent claw centers, Tent and a subclass of $P_{5}$-free graphs, A nice class for the vertex packing problem, On the use of Boolean methods for the computation of the stability number, Maximum weight independent sets in classes related to claw-free graphs, A sufficient condition to extend polynomial results for the maximum independent set problem, New applications of clique separator decomposition for the maximum weight stable set problem, On atomic structure of $P_5$-free subclasses and maximum weight independent set problem, A note on anti-coordination and social interactions, Reconfiguration in bounded bandwidth and tree-depth, The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are $\mathcal{W}$-perfect, Colouring squares of claw-free graphs, On the recognition of fuzzy circular interval graphs, Independent domination in finitely defined classes of graphs, Coloring fuzzy circular interval graphs, Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé, Maximum weight independent sets for ($P_7$,triangle)-free graphs in polynomial time, Scalar aggregation in inconsistent databases., On linear and circular structure of (claw, net)-free graphs, Maximum weight independent set for $\ell$claw-free graphs in polynomial time, Stability number of bull- and chair-free graphs revisited, Weighted independent sets in a subclass of $P_6$-free graphs, On the facets of the stable set polytope of quasi-line graphs, An augmenting graph approach to the stable set problem in $P_{5}$-free graphs, On easy and hard hereditary classes of graphs with respect to the independent set problem, On the structure and stability number of $P_{5}$- and co-chair-free graphs, On well-covered triangulations. I, $P_{5}$-free augmenting graphs and the maximum stable set problem, Stable sets in two subclasses of banner-free graphs, Some results on maximum stable sets in certain $P_{5}$-free graphs, Clique family inequalities for the stable set polytope of quasi-line graphs., Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs, A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs, Maximum weight stable set in ($P_7$, bull)-free graphs and ($S_{1, 2, 3}$, bull)-free graphs, A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems, Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number, Combinatorial and computational aspects of graph packing and graph decomposition, Dominating set is fixed parameter tractable in claw-free graphs, The ellipsoid method and its consequences in combinatorial optimization, On stable set polyhedra for K//(1,3)free graphs, On the cut polyhedron., Induced matchings in intersection graphs., Stabex method for extension of $\alpha$-polynomial hereditary classes., Subexponential-time algorithms for maximum independent set in $P_t$-free and broom-free graphs, Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs, Weighted well-covered claw-free graphs, Independent feedback vertex set for $P_5$-free graphs, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, The stable set polytope of quasi-line graphs, An $\mathcal O(n\sqrt m)$ algorithm for the weighted stable set problem in \{claw, net\}-free graphs with $\alpha(G)\geq 4$, On finding augmenting graphs, A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs, On the algorithmic aspects of strong subcoloring, Correction to: ``A connection between sports and matroids: how many teams can we beat?, On well-covered pentagonalizations of the plane, Maximum regular induced subgraphs in $2P_3$-free graphs, Stability number of bull- and chair-free graphs, On well-covered triangulations. II., On well-covered triangulations. III, On minimal prime extensions of a four-vertex graph in a prime graph, Augmenting graphs for independent sets, Maximum independent sets in subclasses of $P_{5}$-free graphs, On packing shortest cycles in graphs, Gear composition and the stable set polytope, Finding augmenting chains in extensions of claw-free graphs, Graphs without large apples and the maximum weight independent set problem, Cycles of given length in some $K_{1,3}$-free graphs, Stability in CAN-free graphs, Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes, A dichotomy in the complexity of consistent query answering for queries with two atoms, Mind the independence gap, Grundy dominating sequences on $X$-join product, Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs, Stability in $P_5$- and banner-free graphs, Parameterized complexity of independent set in H-free graphs, Recent trends in combinatorial optimization, Brick decompositions and the matching rank of graphs, Stable sets in certain $P_6$-free graphs, Finding maximum cliques in arbitrary and in special graphs, The struction of a graph: Application to CN-free graphs, The maximum clique problem, Penta-extensions of hereditary classes of graphs, Extending matchings in graphs: A survey, Extending matchings in claw-free graphs, The complexity of generalized clique packing, Induced disjoint paths and connected subgraphs for $H$-free graphs, Induced disjoint paths and connected subgraphs for $H$-free graphs, Minimum weighted clique cover on claw‐free perfect graphs, An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†, Solving larger maximum clique problems using parallel quantum annealing, Domination number and feedback vertex number of complements of line graphs, Maximum weight t-sparse set problem on vector-weighted graphs, A polytime preprocess algorithm for the maximum independent set problem, Cutting a tree with subgraph complementation is hard, except for some small trees, Dominoes, Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in $\boldsymbol{H}$-Free Graphs, Unnamed Item, Finding and counting small induced subgraphs efficiently, Counting independent sets in graphs with bounded bipartite pathwidth, Parameterized inapproximability of independent set in $H$-free graphs, Hard and easy instances of L-tromino tilings, Determining the number of internal stability of a graph, Independent sets of maximum weight in ($p,q$)-colorable graphs., An algorithm for the maximum internally stable set in a weighted graph, Integer round-up property for the chromatic number of some $h$-perfect graphs, Enumeration of Maximal Irredundant Sets for Claw-Free Graphs, On the vertex packing problem, Combinatorics and algorithms for augmenting graphs, Some observations on maximum weight stable sets in certain $P_{5}$-free graphs, Independent sets in graphs without subtrees with many leaves, WELL-COVERED GRAPHS: A SURVEY, New results on independent sets in extensions of $2K_2$-free graphs, Coloring graph classes with no induced fork via perfect divisibility, The limits of local search for weighted $k$-set packing, Boundary classes for graph problems involving non-local properties, Hereditary Efficiently Dominatable Graphs, Claw-free strictly Deza graphs, From matchings to independent sets, Dominating sets and Hamiltonicity in $K_{1,3}$-free graphs, Star-shape, Radon number, and minty graphs, On weights of induced paths and cycles in claw-free andK1,r-free graphs, Independent sets in some classes of $S_{i,j,k}$-free graphs, A Note on the Minimum H-Subgraph Edge Deletion, On the facets of stable set polytopes of circular interval graphs, Asymptotics of the chromatic number for quasi-line graphs, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, On the structure of 4-regular planar well-covered graphs, Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs, Tree-Width and Optimization in Bounded Degree Graphs, Unnamed Item, Unnamed Item, Classes of perfect graphs, Maximal strip recovery problem with gaps: hardness and approximation algorithms, Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs, Distance-$d$ independent set problems for bipartite and chordal graphs, Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs, Dominating induced matchings in graphs without a skew star, A reduction algorithm for the weighted stable set problem in claw-free graphs, A note on graphs contraction-critical with respect to independence number, Colouring Squares of Claw-free Graphs, A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees, An $\mathcal{O} (n^2 \log{n})$ algorithm for the weighted stable set problem in claw-free graphs, Covering minimal separators and potential maximal cliques in $P_t$-free graphs, Approximating Incremental Combinatorial Optimization Problems, Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes, Listing Maximal Independent Sets with Minimal Space and Bounded Delay, Domination When the Stars Are Out, Hard graphs for the maximum clique problem, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes, A branch and bound algorithm for the maximum clique problem, On a classification of independence systems, On a classification of independence systems, Independent sets in extensions of 2$K_{2}$-free graphs, Augmenting chains in graphs without a skew star., Unnamed Item, Polynomial algorithm for finding the largest independent sets in graphs without forks, On the maximum independent set problem in subclasses of subcubic graphs, The Maximum Independent Set Problem in Planar Graphs, On the complexity of the independent set problem in triangle graphs, The complexity of dissociation set problems in graphs, Maximum independent sets near the upper bound, Connected vertex cover for $(sP_1+P_5)$-free graphs, Independent Sets in Classes Related to Chair-Free Graphs, A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number, A new distributed approximation algorithm for the maximum weight independent set problem, Layered graphs: applications and algorithms, Separation routine and extended formulations for the stable set problem in claw-free graphs, On cycle transversals and their connected variants in the absence of a small linear forest, A survey on graphs with convex quadratic stability number, Sparse regular induced subgraphs in $2P_3$-free graphs, Computing subset transversals in $H$-free graphs, Maximum weight independent sets for ($S_{1,2,4}$,triangle)-free graphs in polynomial time, Declawing a graph: polyhedra and branch-and-cut algorithms, Maximum independent sets in subcubic graphs: new results, Zero forcing in claw-free cubic graphs, Independent sets in $(P_4+P_4$,triangle)-free graphs, Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs, A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles, Independent Set Reconfiguration in Cographs and their Generalizations, Scheduling two chains of unit jobs on one machine: A polyhedral study, Unnamed Item, Lovász-Schrijver PSD-Operator on Claw-Free Graphs, Counting Weighted Independent Sets beyond the Permanent, Perfect stables in graphs, Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition, Partitioning cographs into cliques and stable sets, On the Stable Set Polytope of Claw-Free Graphs, Dynamic node packing, Packing triangles in bounded degree graphs., Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time., Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure, Unnamed Item, Extending the MAX algorithm for maximum independent set, New sufficient conditions for $\alpha$-redundant vertices, The maximum independent set problem in subclasses of subcubic graphs, Squares of Intersection Graphs and Induced Matchings, On the stable set problem in special $P_{5}$-free graphs, Local transformations of graphs preserving independence number, The $k$-separator problem: polyhedra, complexity and approximation results, Vertex cover at distance on $H$-free graphs

Cites Work