On slim graphs, even pairs, and star-cutsets
type: Item
instance of: scholarly article
title: On slim graphs, even pairs, and star-cutsets
zbMATH Open document ID: 0769.05087
DOI: 10.1016/0012-365X(92)90134-2
author: Chính T. Hoàng
author: Frédéric Maffray
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
review text: A Meyniel graph is a perfect graph in which every odd cycle with at least five vertices has at least two chords. A slim graph is any graph obtained from a Meyniel graph by removing all the edges of a given induced subgraph. The authors prove that every slim graph derived from an \(i\)- triangulated graph is a strict quasi-parity graph.
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 94349
zbMATH Keywords: triangulated graph
zbMATH Keywords: parity graph
zbMATH Keywords: perfect graph
zbMATH Keywords: slim graph
MaRDI profile type: Publication
cites work: Q3286847
cites work: Q3222886
cites work: Q3222874
cites work: Star-cutsets and perfect graphs
cites work: On rigid circuit graphs
cites work: Q5341588
cites work: Q3271426
cites work: Slim graphs
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: A new property of critical imperfect graphs and some consequences
cites work: On the perfect graph conjecture
cites work: Q5596090
cites work: Locally perfect graphs
description: scientific article; zbMATH DE number 94349