AbstractFollowing Maire (Graphs Combin. 10 (3) (1994) 263) we call a loose vertex a vertex whose neighbourhood induces a P4-free graph, and we show that every C4-free Berge graph G which is not a clique either is breakable (i.e. G or Ḡ has a star-cutset) or contains at least two non-adjacent loose vertices. Consequently, every minimal imperfect C4-free graph has loose vertices
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractWe present easily verifiable conditions, under which a graph G contains nonempty vertex-disj...
AbstractLubiw (J. Combin. Theory Ser. B 51 (1991) 24) conjectures that in a minimal imperfect Berge ...
AbstractA conjecture concerning perfect graphs asserts that if for a Berge graph G the following thr...
AbstractLubiw (J. Combin. Theory Ser. B 51 (1991) 24) conjectures that in a minimal imperfect Berge ...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractIn this paper, we summarize previous known results on P5-free minimal imperfect graphs (i.e....
AbstractA graph is murky if neither the graph nor its complement contains a chordless cycle with fiv...
AbstractWe characterize the structure of graphs containing neither the 4-cycle nor its complement as...
AbstractLet G be a minimal imperfect P5-free graph (i.e. a minimal imperfect graph not containing a ...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractA conjecture concerning perfect graphs asserts that if for a Berge graph G the following thr...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractWe present easily verifiable conditions, under which a graph G contains nonempty vertex-disj...
AbstractLubiw (J. Combin. Theory Ser. B 51 (1991) 24) conjectures that in a minimal imperfect Berge ...
AbstractA conjecture concerning perfect graphs asserts that if for a Berge graph G the following thr...
AbstractLubiw (J. Combin. Theory Ser. B 51 (1991) 24) conjectures that in a minimal imperfect Berge ...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the larg...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractIn this paper, we summarize previous known results on P5-free minimal imperfect graphs (i.e....
AbstractA graph is murky if neither the graph nor its complement contains a chordless cycle with fiv...
AbstractWe characterize the structure of graphs containing neither the 4-cycle nor its complement as...
AbstractLet G be a minimal imperfect P5-free graph (i.e. a minimal imperfect graph not containing a ...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractA conjecture concerning perfect graphs asserts that if for a Berge graph G the following thr...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractWe present easily verifiable conditions, under which a graph G contains nonempty vertex-disj...
DOI
Add to ORKG