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 条
12345