Add to ORKGA graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which induces a split graph. We show that the strong perfect graph conjecture is true for 2-split graphs and we design a polynomial algorithm to recognize a perfect 2-split graph
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
AbstractThe Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conject...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs clos...
AbstractA 2-join is an edge cutset that naturally appears in decomposition of several classes of gra...
AbstractWe discuss some new and old results about skew partitions in perfect graphs
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
International audienceDouble split graphs form one of the five basic classes in the proof of the str...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
AbstractPartitionable graphs have been studied by a number of authors in conjunction with attempts a...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
International audienceInspired by a question of Yannakakis on the Vertex Packing polytope of perfect...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
AbstractThe Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conject...
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph ...
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs clos...
AbstractA 2-join is an edge cutset that naturally appears in decomposition of several classes of gra...
AbstractWe discuss some new and old results about skew partitions in perfect graphs
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
International audienceDouble split graphs form one of the five basic classes in the proof of the str...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
AbstractPartitionable graphs have been studied by a number of authors in conjunction with attempts a...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
International audienceInspired by a question of Yannakakis on the Vertex Packing polytope of perfect...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
AbstractThe Strong Perfect Graph Conjecture (SPGC) was certainly one of the most challenging conject...