DOIAbstract
AbstractWe discuss some new and old results about skew partitions in perfect graphs
AbstractWe discuss some new and old results about skew partitions in perfect graphs
International audienceA hole in a graph is an induced cycle on at least four vertices. A graph is Be...
International audienceA hole in a graph is an induced cycle on at least four vertices. A graph is Be...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
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
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We g...
AbstractV. Chvátal conjectured in 1985 that a minimal imperfect graph G cannot have a skew cutset (i...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
AbstractA skew partition is a partition of the vertex set of a graph into four nonempty parts A,B,C,...
AbstractA hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
International audienceA hole in a graph is an induced cycle on at least four vertices. A graph is Be...
International audienceA hole in a graph is an induced cycle on at least four vertices. A graph is Be...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
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
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We g...
AbstractV. Chvátal conjectured in 1985 that a minimal imperfect graph G cannot have a skew cutset (i...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSE Voir aussi l'article basé sur ce d...
AbstractA skew partition is a partition of the vertex set of a graph into four nonempty parts A,B,C,...
AbstractA hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
International audienceA hole in a graph is an induced cycle on at least four vertices. A graph is Be...
International audienceA hole in a graph is an induced cycle on at least four vertices. A graph is Be...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
Add to ORKG