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 条
  • [21] RECOGNIZING DECOMPOSABLE GRAPHS
    CHVATAL, V
    JOURNAL OF GRAPH THEORY, 1984, 8 (01) : 51 - 53
  • [22] Transitive orientations in bull-reducible Berge graphs
    de Figueiredo, Celina
    Maffray, Frederic
    Maciel, Claudia Villela
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (07) : 561 - 573
  • [23] Decomposing Berge graphs and detecting balanced skew partitions
    Trotignon, Nicolas
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2008, 98 (01) : 173 - 225
  • [24] The perfection and recognition of bull-reducible berge graphs
    Everett, H
    de Figueiredo, CMH
    Klein, S
    Reed, B
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2005, 39 (01): : 145 - 160
  • [25] REDUCING PRIME GRAPHS AND RECOGNIZING CIRCLE GRAPHS
    BOUCHET, A
    COMBINATORICA, 1987, 7 (03) : 243 - 254
  • [26] Berge-Fulkerson coloring for C(8)-linked graphs
    Hao, Rong-Xia
    Zhang, Cun-Quan
    Zheng, Ting
    JOURNAL OF GRAPH THEORY, 2018, 88 (01) : 46 - 60
  • [27] Loose vertices in C4-free Berge graphs
    Parfenoff, I
    Roussel, F
    Rusu, I
    DISCRETE MATHEMATICS, 2002, 258 (1-3) : 137 - 160
  • [28] Recognizing Planar Laman Graphs
    Rollin, Jonathan
    Schlipf, Lena
    Schulz, Andre
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [29] On the Complexity of Recognizing Wheeler Graphs
    Gibney, Daniel
    Thankachan, Sharma, V
    ALGORITHMICA, 2022, 84 (03) : 784 - 814
  • [30] RECOGNIZING GENERALIZED SIERPINSKI GRAPHS
    Imrich, Wilfried
    Peterin, Iztok
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2020, 14 (01) : 122 - 137
12345