ENDM
2007
13 years 4 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...
ARSCOM
2006
13 years 4 months ago
2006
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...
DAM
2008
13 years 4 months ago
2008
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...
COMBINATORICA
2008
13 years 4 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...