Clique family inequalities for the stable set polytope of quasi-line graphs.
type: Item
instance of: scholarly article
title: Clique family inequalities for the stable set polytope of quasi-line graphs.
zbMATH Open document ID: 1052.90108
DOI: 10.1016/S0166-218X(03)00400-1
author: D. Massart
published in: Discrete Applied Mathematics
publication date: 2003-12-04T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 2012962
zbMATH Keywords: Polyhedral combinatorics
zbMATH Keywords: Matching polytope
zbMATH Keywords: Claw-free graphs
zbMATH Keywords: Quasi-line graphs
MaRDI profile type: Publication
cites work: Q3941433
cites work: Graphe représentatif des arêtes d'un multigraphe
cites work: Polyhedral characterizations and perfection of line graphs
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: On certain polytopes associated with graphs
cites work: Stable Set Polytopes for a Class of Circulant Graphs
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q4078069
cites work: The rank facets of the stable set polytope for claw-free graphs
cites work: On stable set polyhedra for K//(1,3)free graphs
cites work: Geometric algorithms and combinatorial optimization
cites work: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
cites work: Mobility models for cellular mobile radiotelephone networks: Product forms and blocking
cites work: Q5837982
cites work: Line graphs and forbidden induced subgraphs
cites work: Matching theory
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
cites work: On the facial structure of set packing polyhedra
cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
cites work: Q4234148
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
cites work: Applying Lehman's theorems to packing problems
cites work: A class of facet producing graphs for vertex packing polyhedra
description: scientific article; zbMATH DE number 2012962