Some classes of strongly perfect graphs (Q1304823)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some classes of strongly perfect graphs |
scientific article; zbMATH DE number 1340377
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some classes of strongly perfect graphs |
scientific article; zbMATH DE number 1340377 |
Statements
Some classes of strongly perfect graphs (English)
0 references
2 January 2000
0 references
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.
0 references
strongly perfect graph
0 references
chromatic number
0 references
Meyniel graph
0 references
comparability graph
0 references
costrongly perfect graph
0 references
line graph
0 references
independent set
0 references
