White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Recognizing Berge graphs

Chudnovsky, M, Cornuejols, G, Liu, X, Seymour, P and Vuskovic, K (2005) Recognizing Berge graphs. Combinatorica, 25 (2). 143 - 186 . ISSN 0209-9683

This is the latest version of this eprint.

Full text available as:

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.

Item Type: Article
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 18 Jun 2012 14:39
Last Modified: 08 Feb 2013 17:39
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
URI: http://eprints.whiterose.ac.uk/id/eprint/74371

Available Versions of this Item

Actions (login required)

View Item View Item