Publication date
September 2023
DOI Publisher
AMO Publisher Language
EnglishAbstract
We say that a graph B is berge (see Berge, C. (1989) or Annouk, I. (2012)) if every grap
We say that a graph B is berge (see Berge, C. (1989) or Annouk, I. (2012)) if every grap
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
For a graph G, a hypergraph \scrH is a Berge copy of G (or a Berge-G in short) if there is a biject...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSECahiers de la Maison des Sciences E...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
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...
L'objectif de cette thèse est de réussir à utiliser des décompositions de graphes afin de résoudre d...
We consider the class of Berge graphs that do not contain an induced cycle of length four. We presen...
We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We presen...
URL des Cahiers :<br />http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Scien...
In 1961, Claude Berge proposed the “strong perfect graph conjecture”, probably the most beautiful op...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
The goal of this these is to use graph's decompositions to solve algorithmic problems on graphs. We ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
For a graph G, a hypergraph \scrH is a Berge copy of G (or a Berge-G in short) if there is a biject...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSECahiers de la Maison des Sciences E...
Robertson, Seymour and Thomas in a paper of 146 pages long (see [1]); in this manuscript, via an ori...
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...
L'objectif de cette thèse est de réussir à utiliser des décompositions de graphes afin de résoudre d...
We consider the class of Berge graphs that do not contain an induced cycle of length four. We presen...
We consider the class of Berge graphs that do not contain a chordless cycle of length $4$. We presen...
URL des Cahiers :<br />http://mse.univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Scien...
In 1961, Claude Berge proposed the “strong perfect graph conjecture”, probably the most beautiful op...
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theor...
AbstractWe present two classes of perfect graphs. The first class is defined through a construction ...
The goal of this these is to use graph's decompositions to solve algorithmic problems on graphs. We ...
International audienceA graph is Berge if it has no induced odd cycle on at least 5 vertices and no ...
For a graph G, a hypergraph \scrH is a Berge copy of G (or a Berge-G in short) if there is a biject...
URL des Cahiers : https://halshs.archives-ouvertes.fr/CAHIERS-MSECahiers de la Maison des Sciences E...
Add to ORKG