Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Extremal problems in graph theory (05C35) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Recommendations
- On the facets of the stable set polytope of quasi-line graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- The stable set polytope and some operations on graphs
- Stable Set Polytopes for a Class of Circulant Graphs
- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
- On the stable set polytope of a series-parallel graph
- The stable set polytope of icosahedral graphs
- On the linear extension complexity of stable set polytopes for perfect graphs
- Stability critical graphs and ranks facets of the stable set polytope
- The stable set polytope for some extensions of \(P_4\)-free graphs
Cites work
- scientific article; zbMATH DE number 1263275 (Why is no real title available?)
- scientific article; zbMATH DE number 2086918 (Why is no real title available?)
- 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é
- Applying Lehman's theorems to packing problems
- Chvátal closures for mixed integer programming problems
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Convex hull of the edges of a graph and near bipartite graphs
- Cyclic Scheduling via Integer Programs with Circular Ones
- Edmonds polytopes and a hierarchy of combinatorial problems
- Geometric algorithms and combinatorial optimization
- Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
- Maximum matching and a polyhedron with 0,1-vertices
- Network flows. Theory, algorithms, and applications.
- On Cutting Planes
- On Linear Characterizations of Combinatorial Optimization Problems
- On cutting-plane proofs in combinatorial optimization
- On maximal independent sets of vertices in claw-free graphs
- On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
- On stable set polyhedra for K//(1,3)free graphs
- On the membership problem for the elementary closure of a polyhedron
- On the separation of split cuts and related inequalities
- Outline of an algorithm for integer solutions to linear programs
- Paths, Trees, and Flowers
- The ellipsoid method and its consequences in combinatorial optimization
- The rank facets of the stable set polytope for claw-free graphs
- The structure of claw-free graphs
Cited in
(40)- Colouring squares of claw-free graphs
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- The Turán polytope
- Minor related row family inequalities for the set covering polyhedron of circulant matrices
- Generalized clique family inequalities for claw-free graphs
- Stable sets, corner polyhedra and the Chvàtal closure
- On the facets of stable set polytopes of circular interval graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- On dominating set polyhedra of circular interval graphs
- On mixed-integer sets with two integer variables
- Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
- Stable Set Polytopes for a Class of Circulant Graphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- On the recognition of fuzzy circular interval graphs
- Gear composition and the stable set polytope
- Minimum weighted clique cover on claw‐free perfect graphs
- Lovász-Schrijver PSD-operator on claw-free graphs
- The stable set polytope of claw-free graphs with large stability number
- The stable set polytope of icosahedral graphs
- Facet-inducing web and antiweb inequalities for the graph coloring polytope
- The Chvátal closure of generalized stable sets in bidirected graphs
- On claw-free \(t\)-perfect graphs
- Vertex adjacencies in the set covering polyhedron
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
- On the Stable Set Polytope of Claw-Free Graphs
- Circuits and circulant minors
- Total coloring of quasi-line graphs and inflated graphs
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- Almost all webs are not rank-perfect
- Strengthened clique-family inequalities for the stable set polytope
- Colouring squares of claw-free graphs
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
- Coloring fuzzy circular interval graphs
- On the facets of the stable set polytope of quasi-line graphs
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices
- Total coloring and total matching: polyhedra and facets
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
- Coloring fuzzy circular interval graphs
This page was built for publication: The stable set polytope of quasi-line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949780)
