Recognizing Berge graphs

被引：175
|
作者：
Chudnovsky, M
Cornuéjols, G
Liu, XM
Seymour, P
Vuskovic, K
机构：
[1] Princeton Univ, Dept Math, Princeton, NJ 08544 USA
[2] Carnegie Mellon Univ, Tepper Sch Business, Pittsburgh, PA 15213 USA
[3] Fac Sci Luminy, Lab Informat Fondamentale, F-13288 Marseille, France
来源：
COMBINATORICA | 2005年 / 25卷 / 02期
关键词：
D O I：
10.1007/s00493-005-0012-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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(vertical bar V(G)vertical bar(9)). This is independent of the recent proof of the strong perfect graph conjecture.
引用
收藏
页码：143 / 186
页数：44
相关论文
共 50 条
  • [31] On the Complexity of Recognizing Wheeler Graphs
    Gibney, Daniel
    Thankachan, Sharma, V
    ALGORITHMICA, 2022, 84 (03) : 784 - 814
  • [32] Recognizing DNA graphs is difficult
    Pendavingh, R
    Schuurman, P
    Woeginger, GJ
    DISCRETE APPLIED MATHEMATICS, 2003, 127 (01) : 85 - 94
  • [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] Recognizing string graphs is decidable
    Pach, J
    Tóth, G
    DISCRETE & COMPUTATIONAL GEOMETRY, 2002, 28 (04) : 593 - 606
12345