10 search results - page 1 / 2 » The stable set polytope of quasi-line graphs |
83
Voted
ENDM
2007
14 years 10 months ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
76
Voted
ORL
2008
14 years 10 months ago
2008
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields cou...
87
Voted
ORL
2008
14 years 10 months ago
2008
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...
81
Voted
COMBINATORICA
2008
14 years 11 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
4OR
2005
14 years 10 months ago
2005
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...