Add to ORKGWe develop decomposition/composition tools for efficiently solving maximum weight stable sets problems as well as for describing them as polynomially sized linear programs (using "compact systems"). Some of these are well-known but need some extra work to yield polynomial "decomposition schemes". We apply the tools to graphs with no even hole and no cap. A hole is a chordless cycle of length greater than three and a cap is a hole together with an additional node that is adjacent to two adjacent nodes of the hole and that has no other neighbors on the hole
In this paper we consider the class of simple graphs defined by excluding, as induced subgraphs, eve...
The class of even-hole-free graphs is structurally quite similar to the class of perfect graphs, whi...
AbstractWe answer a question of Corneil and Fonlupt by showing that deciding whether a graph has a s...
We develop decomposition/composition tools for efficiently solving maximum weight stable sets proble...
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-fr...
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of ...
In this thesis we consider the class of simple graphs defined by excluding even holes (i.e. chordles...
AbstractThis paper proves that if a graph G has a stable cutset S such that no vertex of S lies on a...
The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particul...
A hole is a chordless cycle of length at least four, and is even or odd depending onthe parity of it...
AbstractWe give several classes of facets for the convex hull of incidence vectors of stable sets in...
Stable set problems subsume matching problems since a matching is a stable set in a so- called line...
AbstractFor some graph classes defined by forbidding one-vertex extensions of the P4, we introduce a...
We prove a decomposition theorem for even-hole-free graphs. The decompositions used are 2-joins and ...
AbstractSeveral applications of methods from nonlinear algebra to the stable set problem in graphs a...
In this paper we consider the class of simple graphs defined by excluding, as induced subgraphs, eve...
The class of even-hole-free graphs is structurally quite similar to the class of perfect graphs, whi...
AbstractWe answer a question of Corneil and Fonlupt by showing that deciding whether a graph has a s...
We develop decomposition/composition tools for efficiently solving maximum weight stable sets proble...
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-fr...
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of ...
In this thesis we consider the class of simple graphs defined by excluding even holes (i.e. chordles...
AbstractThis paper proves that if a graph G has a stable cutset S such that no vertex of S lies on a...
The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particul...
A hole is a chordless cycle of length at least four, and is even or odd depending onthe parity of it...
AbstractWe give several classes of facets for the convex hull of incidence vectors of stable sets in...
Stable set problems subsume matching problems since a matching is a stable set in a so- called line...
AbstractFor some graph classes defined by forbidding one-vertex extensions of the P4, we introduce a...
We prove a decomposition theorem for even-hole-free graphs. The decompositions used are 2-joins and ...
AbstractSeveral applications of methods from nonlinear algebra to the stable set problem in graphs a...
In this paper we consider the class of simple graphs defined by excluding, as induced subgraphs, eve...
The class of even-hole-free graphs is structurally quite similar to the class of perfect graphs, whi...
AbstractWe answer a question of Corneil and Fonlupt by showing that deciding whether a graph has a s...