Add to ORKGColloque sans acte à diffusion restreinte. internationale.International audienceBerge's well known SPGC (Strong Perfect Graph Conjecture) states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices x, a, b, c, d and five edges xa, xb, ab, ad, bc. A graph is bull-reducible if no vertex is in two bulls. We prove that every bull-reducible Berge graph is perfect and we exhibit a polynomial-time recognition algorithm for bull-reducible Berge graphs
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
We establish a new connection between the theory of Berge graphs (perfect graphs) and communication ...
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 bull is a graph with five vertices r,y,x,z,s and five edges ry, yx, yz, xz, zs. A graph G ...
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 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...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
URL des Cahiers :http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Sciences Ec...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractIn this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and w...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
We establish a new connection between the theory of Berge graphs (perfect graphs) and communication ...
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 bull is a graph with five vertices r,y,x,z,s and five edges ry, yx, yz, xz, zs. A graph G ...
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 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...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
URL des Cahiers :http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Sciences Ec...
AbstractIn this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes ...
AbstractIn this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and w...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd h...
We establish a new connection between the theory of Berge graphs (perfect graphs) and communication ...
We say that a graph B is berge (see Berge, C. (1989) or Annouk, I. (2012)) if every grap