Sciweavers

Share
ENDM
2007
91views more  ENDM 2007»
8 years 6 months ago
On facets of stable set polytopes of claw-free graphs with stability number three
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...
Arnaud Pêcher, Pierre Pesneau, Annegret Wagl...
ARSCOM
2006
72views more  ARSCOM 2006»
8 years 6 months ago
A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs
Abstract. There are several well-known and important hamiltonian results for claw-free graphs but only a few are concerned with quasi-claw-free graphs. In this note, we provide a n...
Jou-Ming Chang, An-Hang Chen
DAM
2008
87views more  DAM 2008»
8 years 6 months ago
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
Flavia Bonomo, Maria Chudnovsky, Guillermo Dur&aac...
COMBINATORICA
2008
89views more  COMBINATORICA 2008»
8 years 6 months ago
The stable set polytope of quasi-line graphs
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...
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier St...
books