DOIAbstract
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the graph is perfect. This generalizes a result of Gallai and Suranyi and also a result of Olaru and Sachs
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the graph is perfect. This generalizes a result of Gallai and Suranyi and also a result of Olaru and Sachs
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the g...
AbstractMeyniel (Discrete Math.16 (1976), 339–342) proved that a graph is perfect whenever each of i...
AbstractThe Even Pair Lemma, proved by Meyniel, states that no minimal imperfect graph contains a pa...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
AbstractMeyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices...
The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite ...
We prove a new property of critical imperfect graphs. As a consequence, we define a new class of per...
We prove a new property of critical imperfect graphs. As a consequence, we define a new class of per...
AbstractWe prove that a graph is perfect if its vertices can be coloured by two colours in such a wa...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
We prove the following theorem: If every, odd cycle of length ≥5 has at least two chords, then the g...
AbstractMeyniel (Discrete Math.16 (1976), 339–342) proved that a graph is perfect whenever each of i...
AbstractThe Even Pair Lemma, proved by Meyniel, states that no minimal imperfect graph contains a pa...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
AbstractMeyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices...
The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite ...
We prove a new property of critical imperfect graphs. As a consequence, we define a new class of per...
We prove a new property of critical imperfect graphs. As a consequence, we define a new class of per...
AbstractWe prove that a graph is perfect if its vertices can be coloured by two colours in such a wa...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
Add to ORKG