AbstractMeyniel (Discrete Math.16 (1976), 339–342) proved that a graph is perfect whenever each of its odd cycles of length at least five has at least two chords. This result is strengthened by proving that every graph satisfying Meyniel's condition is strongly perfect (i.e., each of its induced subgraphs H contains a stable set which meets all the maximal cliques in H)
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractWe prove that the strong perfect graph conjecture holds for graphs that do not contain parac...
AbstractMeyniel (Discrete Math.16 (1976), 339–342) proved that a graph is perfect whenever each of i...
AbstractA graph G is said to be very strongly perfect if for each induced subgraph H of G, each vert...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractMeyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices...
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...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
A strong stable set in a graph $G$ is a stable set that contains a vertex of every maximal clique of...
Univ Chile, Ctr Modelamiento Matemat, Santiago 2120, ChileA connected graph G is called t-perfect if...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractWe prove that the strong perfect graph conjecture holds for graphs that do not contain parac...
AbstractMeyniel (Discrete Math.16 (1976), 339–342) proved that a graph is perfect whenever each of i...
AbstractA graph G is said to be very strongly perfect if for each induced subgraph H of G, each vert...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractA graph is perfect if for each of its induced subgraphs H, the chromatic number of H is equa...
AbstractMeyniel proved that a graph G is perfect if every odd cycle of G with at least five vertices...
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...
AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less tha...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
A strong stable set in a graph $G$ is a stable set that contains a vertex of every maximal clique of...
Univ Chile, Ctr Modelamiento Matemat, Santiago 2120, ChileA connected graph G is called t-perfect if...
AbstractPerfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs ha...
The partition number θ of a graph G is the minimum number of cliques which cover the points of ...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractWe prove that the strong perfect graph conjecture holds for graphs that do not contain parac...
DOI
Add to ORKG