On maximal independent sets of vertices in claw-free graphs

Cites work

scientific article; zbMATH DE number 3643026 (Why is no real title available?)
scientific article; zbMATH DE number 3172309 (Why is no real title available?)
scientific article; zbMATH DE number 3235858 (Why is no real title available?)
scientific article; zbMATH DE number 3297030 (Why is no real title available?)
scientific article; zbMATH DE number 3338381 (Why is no real title available?)
scientific article; zbMATH DE number 3080072 (Why is no real title available?)
A Characterization of Comparability Graphs and of Interval Graphs
Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
Maximum matching and a polyhedron with 0,1-vertices
On the notion of balance of a signed graph
Paths, Trees, and Flowers
Strongly regular graphs, partial geometries and partially balanced designs
TWO THEOREMS IN GRAPH THEORY
The interchange graph of a finite graph

Cited in

(only showing first 100 items - show all)

Solving the weighted stable set problem in claw-free graphs via decomposition
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
Layered graphs: applications and algorithms
An exact algorithm for the maximum stable set problem
scientific article; zbMATH DE number 7651162 (Why is no real title available?)
Dynamic node packing
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are $\mathcal{W}$-perfect
Independent set reconfiguration in cographs and their generalizations
On the recognition of fuzzy circular interval graphs
On independent vertex sets in subclasses of apple-free graphs
A reduction algorithm for the weighted stable set problem in claw-free graphs
Connected vertex cover for $(sP_1+P_5)$-free graphs
On cycle transversals and their connected variants in the absence of a small linear forest
An algorithm for the maximum internally stable set in a weighted graph
The maximum clique problem
Coloring fuzzy circular interval graphs
Independent sets of maximum weight in ($p,q$)-colorable graphs.
Solving larger maximum clique problems using parallel quantum annealing
Separation routine and extended formulations for the stable set problem in claw-free graphs
Stability in CAN-free graphs
Extending the MAX algorithm for maximum independent set
Perfect stables in graphs
Combinatorial and computational aspects of graph packing and graph decomposition
Graphs without large apples and the maximum weight independent set problem
On a classification of independence systems
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
Colouring squares of claw-free graphs
Independent sets in some classes of $S_{i,j,k}$-free graphs
Maximum weight t-sparse set problem on vector-weighted graphs
Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
scientific article; zbMATH DE number 7651174 (Why is no real title available?)
Brick decompositions and the matching rank of graphs
A note on graphs contraction-critical with respect to independence number
Maximum regular induced subgraphs in 2P₃-free graphs
Independent feedback vertex set for P₅-free graphs
The Maximum Independent Set Problem in Planar Graphs
The struction of a graph: Application to CN-free graphs
Vertex cover at distance on $H$-free graphs
Gear composition and the stable set polytope
On the complexity of list $\mathcal{H}$-packing for sparse graph classes
On the vertex packing problem
Max weight independent set in graphs with no long claws: an analog of the Gyárfás' path argument
The stable set polytope of claw-free graphs with large stability number
On claw-free asteroidal triple-free graphs
A polytime preprocess algorithm for the maximum independent set problem
Augmenting approach for some maximum set problems
Independent set reconfiguration in H-free graphs
The maximum independent set problem in subclasses of $S_{i, j, k}$-free graphs
On the feedback vertex set polytope of a series-parallel graph
Lovász-Schrijver PSD-operator on claw-free graphs
A branch and bound algorithm for the maximum clique problem
Dominoes
Recognizing $\text{W}_2$ graphs
A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
Determining the number of internal stability of a graph
On the use of Boolean methods for the computation of the stability number
Distance-$d$ independent set problems for bipartite and chordal graphs
A dichotomy in the complexity of consistent query answering for queries with two atoms
On finite groups whose power graph is claw-free
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
The ellipsoid method and its consequences in combinatorial optimization
Enumeration of maximal irredundant sets for claw-free graphs
The complexity of dissociation set problems in graphs
On the cut polyhedron.
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
On the stable set problem in special $P_{5}$-free graphs
Stabex method for extension of $\alpha$-polynomial hereditary classes.
Cutting a tree with subgraph complementation is hard, except for some small trees
Polynomial algorithms for the maximum stable set problem on particular classes of $P_{5}$-free graphs
scientific article; zbMATH DE number 7742928 (Why is no real title available?)
Approximation algorithm for the distance-3 independent set problem on cubic graphs
Claw-free strictly Deza graphs
An $\mathcal O(n\sqrt m)$ algorithm for the weighted stable set problem in \{claw, net\}-free graphs with $\alpha(G)\geq 4$
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?
Enumeration of maximal irredundant sets for claw-free graphs
Claw-free graphs---a survey
Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
On easy and hard hereditary classes of graphs with respect to the independent set problem
A survey on graphs with convex quadratic stability number
Finding and counting small induced subgraphs efficiently
Weighted independent sets in classes of $P_6$-free graphs
The limits of local search for weighted $k$-set packing
Cutting a tree with subgraph complementation is hard, except for some small trees
Maximum weight independent sets in classes related to claw-free graphs
On atomic structure of $P_5$-free subclasses and maximum weight independent set problem
Hard and easy instances of L-tromino tilings
Parameterized inapproximability of independent set in $H$-free graphs
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
Complexity of chess domination problems
Maximum independent sets near the upper bound
On finding augmenting graphs
New results on independent sets in extensions of $2K_2$-free graphs
Stability in $P_5$- and banner-free graphs
Augmenting chains in graphs without a skew star.
On packing shortest cycles in graphs
Independent sets of maximum weight beyond claw-free graphs and related problems
Independent sets in extensions of 2$K_{2}$-free graphs
From matchings to independent sets

This page was built for publication: On maximal independent sets of vertices in claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1139605)