AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most α + ω − 1 which meets every ω-clique and every α-stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as strong as Berge's strong perfect graph conjecture for a very large class of graphs, namely for those graphs whose diameter does not exceed 6
AbstractA clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A...
International audienceCircular-perfect graphs form a natural superclass of perfect graphs: on the on...
AbstractThe folloeing problem is investigated. Given an undirected graph G, determine the smallest c...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs ...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractPartitionable graphs have been studied by a number of authors in conjunction with attempts a...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractAn undirected graph is trivially perfect if for every induced subgraph the stability number ...
AbstractLet G be a minimal imperfect P5-free graph (i.e. a minimal imperfect graph not containing a ...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractIn this paper, we give counterexamples to the conjecture: “Every nonempty regular simple gra...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
AbstractA clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A...
International audienceCircular-perfect graphs form a natural superclass of perfect graphs: on the on...
AbstractThe folloeing problem is investigated. Given an undirected graph G, determine the smallest c...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs ...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractPartitionable graphs have been studied by a number of authors in conjunction with attempts a...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractAn undirected graph is trivially perfect if for every induced subgraph the stability number ...
AbstractLet G be a minimal imperfect P5-free graph (i.e. a minimal imperfect graph not containing a ...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractIn this paper, we give counterexamples to the conjecture: “Every nonempty regular simple gra...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
AbstractA clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A...
International audienceCircular-perfect graphs form a natural superclass of perfect graphs: on the on...
AbstractThe folloeing problem is investigated. Given an undirected graph G, determine the smallest c...