A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V (G)|9). This is independent of the recent proof of the strong perfect graph conjecture
The Strong Perfect Graph Conjecture of Claude Berge is now nearly 25 years old. Efforts to resolve t...
AbstractA hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has ...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the compleme...
A graph is Berge if no induced subgraph of G is an odd cycle of length at least ve or the complement...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
Colloque sans acte à diffusion restreinte. internationale.International audienceBerge's well known S...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
We say that a graph B is berge (see Berge, C. (1989) or Annouk, I. (2012)) if every grap
The recently announced Strong Perfect Graph Theorem states that the class of perfect graphs coincide...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
In 1961, Claude Berge proposed the “strong perfect graph conjecture”, probably the most beautiful op...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
In 1961, Claude Berge proposed the \strong perfect graph conjecture", probably the most beautif...
The Strong Perfect Graph Conjecture of Claude Berge is now nearly 25 years old. Efforts to resolve t...
AbstractA hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has ...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the compleme...
A graph is Berge if no induced subgraph of G is an odd cycle of length at least ve or the complement...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
Colloque sans acte à diffusion restreinte. internationale.International audienceBerge's well known S...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
We say that a graph B is berge (see Berge, C. (1989) or Annouk, I. (2012)) if every grap
The recently announced Strong Perfect Graph Theorem states that the class of perfect graphs coincide...
AbstractA graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals ...
In 1961, Claude Berge proposed the “strong perfect graph conjecture”, probably the most beautiful op...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
In 1961, Claude Berge proposed the \strong perfect graph conjecture", probably the most beautif...
The Strong Perfect Graph Conjecture of Claude Berge is now nearly 25 years old. Efforts to resolve t...
AbstractA hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has ...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
DOI
Add to ORKG