3 search results - page 1 / 1 » On non-rank facets of stable set polytopes of webs with cliq... |
DAM
2006
13 years 10 months ago
2006
MP
2006
13 years 10 months ago
2006
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]...
ENDM
2007
13 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...