Recognizing Berge Graphs

被引：0
|
作者：
Maria Chudnovsky*
Gérard Cornuéjols**
Xinming Liu†
Paul Seymour†
Kristina Vušković‡
机构：
[1] Princeton University,Mathematics Dept
[2] Fine Hall,Tepper School of Business
[3] Carnegie Mellon University,Laboratoire d’Informatique
[4] Fondamentale Faculté des Sciences de Luminy,Tepper School of Business
[5] Carnegie Mellon University,Mathematics Dept
[6] Princeton University,School of Computing
[7] Fine Hall,undefined
[8] University of Leeds,undefined
来源：
Combinatorica | 2005年 / 25卷
关键词：
05C17;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
下载
收藏
页码：143 / 186
页数：43
相关论文
共 50 条
  • [31] Recognizing DNA graphs is difficult
    Pendavingh, R
    Schuurman, P
    Woeginger, GJ
    DISCRETE APPLIED MATHEMATICS, 2003, 127 (01) : 85 - 94
  • [32] Loose vertices in C4-free Berge graphs
    Parfenoff, I
    Roussel, F
    Rusu, I
    DISCRETE MATHEMATICS, 2002, 258 (1-3) : 137 - 160
  • [33] Recognizing random intersection graphs
    Prisner, E
    DISCRETE MATHEMATICS, 2000, 223 (1-3) : 263 - 274
  • [34] ON THE COMPLEXITY OF RECOGNIZING TOUGH GRAPHS
    BAUER, D
    MORGANA, A
    SCHMEICHEL, E
    DISCRETE MATHEMATICS, 1994, 124 (1-3) : 13 - 17
  • [35] Recognizing string graphs in NP
    Schaefer, M
    Sedgwick, E
    Stefankovic, D
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (02) : 365 - 380
  • [36] On the Complexity of Recognizing Wheeler Graphs
    Daniel Gibney
    Sharma V. Thankachan
    Algorithmica, 2022, 84 : 784 - 814
  • [37] Recognizing Weak Embeddings of Graphs
    Akitaya, Hugo A.
    Fulek, Radoslav
    Toth, Csaba D.
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 274 - 292
  • [38] On the complexity of recognizing tenacious graphs
    Golshani, Ali
    Moazzami, Dara
    Amiri, Saeed Akhondian
    ARS COMBINATORIA, 2017, 131 : 11 - 21
  • [39] Recognizing string graphs is decidable
    Pach, J
    Tóth, G
    GRAPH DRAWING, 2002, 2265 : 247 - 260
  • [40] On Recognizing Graphs by Numbers of Homomorphisms
    Dvorak, Zdenek
    JOURNAL OF GRAPH THEORY, 2010, 64 (04) : 330 - 342
12345