Forced color classes, intersection graphs and the strong perfect graph conjecture
type: Item
instance of: scholarly article
title: Forced color classes, intersection graphs and the strong perfect graph conjecture
zbMATH Open document ID: 0943.68124
DOI: 10.1016/S0304-3975(99)00201-7
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1454449
zbMATH Keywords: minimally imperfect graphs
zbMATH Keywords: forced color class
zbMATH Keywords: strong perfect graph conjecture
Wikidata QID: Q122900406
author: Tadashi Sakuma
MaRDI profile type: Publication
cites work: Graphical properties related to minimal imperfection
cites work: Q3220614
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: A characterization of perfect graphs
cites work: Perfect zero–one matrices
cites work: On critical edges in minimal imperfect graphs
cites work: Critical perfect graphs and perfect 3-chromatic graphs
full work available at URL: s0304-3975(99)00201-7
OpenAlex ID: W2063103911
description: scientific article; zbMATH DE number 1454449