Sciweavers

3 search results - page 1 / 1
» A construction for non-rank facets of stable set polytopes o...
Sort
View
MP
2006
81views more  MP 2006»
13 years 4 months ago
Almost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
Arnaud Pêcher, Annegret Wagler