AbstractV. Chvátal conjectured in 1985 that a minimal imperfect graph G cannot have a skew cutset (i.e., a cutset S decomposable into disjoint sets A and B joined by all possible edges). We prove here the conjecture in the particular case where at least one of A and B is a stable set
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs ...
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chord...
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chord...
AbstractV. Chvátal conjectured in 1985 that a minimal imperfect graph G cannot have a skew cutset (i...
AbstractWe discuss some new and old results about skew partitions in perfect graphs
AbstractA skew partition is a partition of the vertex set of a graph into four nonempty parts A,B,C,...
AbstractWe show that a minimal imperfect graph G cannot contain a cutset C which induces a complete ...
AbstractWe show that a minimal imperfect graph G cannot contain a cutset C which induces a complete ...
AbstractLet G be a minimal imperfect P5-free graph (i.e. a minimal imperfect graph not containing a ...
We show that it is NP-complete to test for the existence of a stable cutset in a graph. This is a co...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We g...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractH. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by...
International audienceInspired by a question of Yannakakis on the Vertex Packing polytope of perfect...
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs ...
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chord...
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chord...
AbstractV. Chvátal conjectured in 1985 that a minimal imperfect graph G cannot have a skew cutset (i...
AbstractWe discuss some new and old results about skew partitions in perfect graphs
AbstractA skew partition is a partition of the vertex set of a graph into four nonempty parts A,B,C,...
AbstractWe show that a minimal imperfect graph G cannot contain a cutset C which induces a complete ...
AbstractWe show that a minimal imperfect graph G cannot contain a cutset C which induces a complete ...
AbstractLet G be a minimal imperfect P5-free graph (i.e. a minimal imperfect graph not containing a ...
We show that it is NP-complete to test for the existence of a stable cutset in a graph. This is a co...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We g...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractH. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by...
International audienceInspired by a question of Yannakakis on the Vertex Packing polytope of perfect...
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs ...
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chord...
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chord...
DOI
Add to ORKG