3 search results - page 1 / 1 » On non-rank facets of stable set polytopes of webs with cliq... |
82
Voted
DAM
2006
14 years 10 months ago
2006
103
click to vote
MP
2006
14 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]...
79
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...