AbstractWe give several classes of facets for the convex hull of incidence vectors of stable sets in a K1,3-free graph, including facets with (a, a + 1)-valued coefficients, where a = 1, 2, 3,…. These provide counterexamples to three recent conjectures concerning such facets. We also give a necessary and sufficient condition for a minimal imperfect graph to be an odd hole or an odd antihole and indicate that minimal imperfect K1,3-free graphs satisfy the condition
The Maximum Stable Set (MS) problem is a well known NP-hard problem. However different graph classes...
A hole is a chordless cycle of length at least four, and is even or odd depending onthe parity of it...
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of ...
AbstractWe give several classes of facets for the convex hull of incidence vectors of stable sets in...
AbstractThis paper proves that if a graph G has a stable cutset S such that no vertex of S lies on a...
We develop decomposition/composition tools for efficiently solving maximum weight stable sets proble...
AbstractThis paper provides a complete characterization of the rank facets of the stable set polytop...
AbstractRank inequalities due to stability critical (a-critical) graphs are used to develop a finite...
AbstractFor some graph classes defined by forbidding one-vertex extensions of the P4, we introduce a...
AbstractObtaining a complete description of the stable set polytopes of claw-free graphs is a long-s...
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Gi...
AbstractSeveral applications of methods from nonlinear algebra to the stable set problem in graphs a...
AbstractWe study some operations on graphs in relation to the stable set polytope, for instance, ide...
A stable set of a graph is a set of pairwise non-adjacent vertices. The maximum stable set problem i...
AbstractIn 1996, A. Sebő[11] raised the following two conjectures concerned with the famous Strong P...
The Maximum Stable Set (MS) problem is a well known NP-hard problem. However different graph classes...
A hole is a chordless cycle of length at least four, and is even or odd depending onthe parity of it...
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of ...
AbstractWe give several classes of facets for the convex hull of incidence vectors of stable sets in...
AbstractThis paper proves that if a graph G has a stable cutset S such that no vertex of S lies on a...
We develop decomposition/composition tools for efficiently solving maximum weight stable sets proble...
AbstractThis paper provides a complete characterization of the rank facets of the stable set polytop...
AbstractRank inequalities due to stability critical (a-critical) graphs are used to develop a finite...
AbstractFor some graph classes defined by forbidding one-vertex extensions of the P4, we introduce a...
AbstractObtaining a complete description of the stable set polytopes of claw-free graphs is a long-s...
We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Gi...
AbstractSeveral applications of methods from nonlinear algebra to the stable set problem in graphs a...
AbstractWe study some operations on graphs in relation to the stable set polytope, for instance, ide...
A stable set of a graph is a set of pairwise non-adjacent vertices. The maximum stable set problem i...
AbstractIn 1996, A. Sebő[11] raised the following two conjectures concerned with the famous Strong P...
The Maximum Stable Set (MS) problem is a well known NP-hard problem. However different graph classes...
A hole is a chordless cycle of length at least four, and is even or odd depending onthe parity of it...
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of ...