Chudnovsky, M, Cornuejols, G, Liu, X et al. (2 more authors) (2005) Recognizing Berge graphs. Combinatorica, 25 (2). 143 - 186 . ISSN 0209-9683
Abstract
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.
Metadata
| Item Type: | Article |
|---|---|
| Authors/Creators: |
|
| Dates: |
|
| Institution: | The University of Leeds |
| Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
| Depositing User: | Symplectic Publications |
| Date Deposited: | 18 Jun 2012 14:39 |
| Last Modified: | 04 Nov 2016 00:36 |
| Published Version: | http://dx.doi.org/10.1007/s00493-005-0012-8 |
| Status: | Published |
| Publisher: | Springer Verlag |
| Identification Number: | 10.1007/s00493-005-0012-8 |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:74371 |
Download not available
A full text copy of this item is not currently available from White Rose Research Online
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)