Some classes of strongly perfect graphs
type: Item
instance of: scholarly article
title: Some classes of strongly perfect graphs
zbMATH Open document ID: 0928.05028
DOI: 10.1016/S0012-365X(98)00407-5
author: G. Ravindra
published in: Discrete Mathematics
publication date: 2000-01-02T00:00:00Z
review text: A graph is said to be strongly perfect if each of its induced subgraphs \(H\) contains an independent set which meets all the cliques (maximal complete subgraphs) in it. Every strongly perfect graph is perfect but the converse is generally not valid. Meyniel graphs, line graphs that are free from some graphs, comparability graphs, costrongly perfect graphs are some of the most important classes of strongly perfect graphs. In this paper the results concerning strongly perfect graphs are summarized.
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1340377
zbMATH Keywords: strongly perfect graph
zbMATH Keywords: chromatic number
zbMATH Keywords: Meyniel graph
zbMATH Keywords: comparability graph
zbMATH Keywords: costrongly perfect graph
zbMATH Keywords: line graph
zbMATH Keywords: independent set
reviewed by: Ioan Tomescu
MaRDI profile type: Publication
full work available at URL: s0012-365x(98)00407-5
OpenAlex ID: W2105838663
Wikidata QID: Q127829989
description: scientific article; zbMATH DE number 1340377