Three-colourable perfect graphs without even pairs
type: Item
instance of: scholarly article
title: Three-colourable perfect graphs without even pairs
zbMATH Open document ID: 1236.05090
author: Maria Chudnovsky
author: Paul Seymour
published in: Journal of Combinatorial Theory. Series B
publication date: 2012-05-04T00:00:00Z
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6030278
zbMATH Keywords: perfect graphs
zbMATH Keywords: Berge graphs
zbMATH Keywords: 2-join
zbMATH Keywords: without even pairs
zbMATH Keywords: without clique cutsets
zbMATH Keywords: line graphs
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
full work available at URL: j.jctb.2011.11.005
OpenAlex ID: W2145520578
cites work: Recognizing Berge graphs
cites work: Even pairs in Berge graphs
cites work: The strong perfect graph theorem
cites work: \(K_{4}\)-free graphs with no odd holes
cites work: Even pairs
cites work: Q4810376
cites work: About skew partitions in minimal imperfect graphs
cites work: Critical perfect graphs and perfect 3-chromatic graphs
cites work: Q3680855
cites work: K4-free graphs with no odd hole: Even pairs and the circular chromatic number
DOI: 10.1016/J.JCTB.2011.11.005
description: scientific article; zbMATH DE number 6030278