Recognizing Berge Graphs

By M. Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic. Comb., 2005

315 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/0542af2c2cc00b4b5a58f4054e0dece580d6af18

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Kristina Vuskovic
2. Paul D. Seymour
3. M. Chudnovsky

Citations in the corpus

• Excluding induced subgraphs (2006, methodology): “We remark that both algorithms in [5] test for Bergeness, and not for the family of odd holes.”
• EVEN-HOLE-FREE GRAPHS: A SURVEY (2010, methodology): “recognition problems for which algorithms exist using only one of the methods, for example recognizing 3PC(Δ, ·)-free graphs is only known by the direct method [7] and recognizing graphs with no cycle with a unique chord is only known by the decomposition method [45].”