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
AbstractH. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
For each positive integer k, we consider the set A k of all ordered pairs [a, b] such that in every ...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
Graphs and AlgorithmsA clique-transversal set in a graph is a subset of the vertices that meets all ...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
The intention of this work is to study problems about transversals of graphs. A transversal of a gra...
The intention of this work is to study problems about transversals of graphs. A transversal of a gra...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs ...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractLubiw (J. Combin. Theory Ser. B 51 (1991) 24) conjectures that in a minimal imperfect Berge ...
AbstractLet G be a simple graph and let X be its vertex-set. A set T ⊆ X is a transversal of the odd...
AbstractCircular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to ...
AbstractH. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
For each positive integer k, we consider the set A k of all ordered pairs [a, b] such that in every ...
AbstractChvátal (1984) proved that no minimal imperfect graph has a small transversal, that is, a se...
Graphs and AlgorithmsA clique-transversal set in a graph is a subset of the vertices that meets all ...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
The intention of this work is to study problems about transversals of graphs. A transversal of a gra...
The intention of this work is to study problems about transversals of graphs. A transversal of a gra...
AbstractAn edge of a graph is calledcritical, if deleting it the stability number of the graph incre...
The characterization of strongly perfect graphs by a restricted list of forbidden induced subgraphs ...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractLubiw (J. Combin. Theory Ser. B 51 (1991) 24) conjectures that in a minimal imperfect Berge ...
AbstractLet G be a simple graph and let X be its vertex-set. A set T ⊆ X is a transversal of the odd...
AbstractCircular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to ...
AbstractH. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
For each positive integer k, we consider the set A k of all ordered pairs [a, b] such that in every ...