Clique family inequalities for the stable set polytope of quasi-line graphs.

DOI10.1016/S0166-218X(03)00400-1zbMath1052.90108MaRDI QIDQ1414593

D. Massart

Publication date: 4 December 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Polyhedral combinatorics; Claw-free graphs; Matching polytope; Quasi-line graphs

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Unnamed Item, Almost all webs are not rank-perfect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
• On stable set polyhedra for K//(1,3)free graphs
• Geometric algorithms and combinatorial optimization
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A class of facet producing graphs for vertex packing polyhedra
• The rank facets of the stable set polytope for claw-free graphs
• Polyhedral characterizations and perfection of line graphs
• On certain polytopes associated with graphs
• Line graphs and forbidden induced subgraphs
• Applying Lehman's theorems to packing problems
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Graphe représentatif des arêtes d'un multigraphe
• Edmonds polytopes and a hierarchy of combinatorial problems
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Stable Set Polytopes for a Class of Circulant Graphs
• On the facial structure of set packing polyhedra
• Maximum matching and a polyhedron with 0,1-vertices