No odd pairs in minimal imperfect NP\({}_{5}\) graphs.
type: Item
instance of: scholarly article
title: No odd pairs in minimal imperfect NP\({}_{5}\) graphs.
zbMATH Open document ID: 1043.05055
DOI: 10.1016/S0020-0190(01)00329-5
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1856410
zbMATH Keywords: Graph algorithms
author: Jean-Luc Fouquet
MaRDI profile type: Publication
cites work: On minimal cutsets in \(P_5\)-free minimal imperfect graphs
cites work: On minimal imperfect graphs without induced \(P_5\)
cites work: Star-cutsets and perfect graphs
cites work: Transformations which Preserve Perfectness and H-Perfectness of Graphs
cites work: Discs in unbreakable graphs
cites work: Some properties of minimal imperfect graphs
cites work: A new property of critical imperfect graphs and some consequences
cites work: A new conjecture about minimal imperfect graphs
cites work: Coloring perfect \((K_ 4\)-e)-free graphs
full work available at URL: s0020-0190(01)00329-5
OpenAlex ID: W2023742793
Recommended article: On minimal imperfect graphs without induced \(P_5\)
Recommended article: Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
Recommended article: On minimal cutsets in \(P_5\)-free minimal imperfect graphs
Recommended article: No antitwins in minimal imperfect graphs
Recommended article: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
Recommended article: On embeddings of graphs containing noK5-minor
Recommended article: Graphs without induced P5and C5
Recommended article: Towards Erdős-Hajnal for graphs with no 5-hole
Recommended article: Improper colouring of graphs with no odd clique minor
Recommended article: A new conjecture about minimal imperfect graphs
description: scientific article; zbMATH DE number 1856410