A class of strongly perfect graphs (Q1060228)
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: A class of strongly perfect graphs |
scientific article; zbMATH DE number 3906538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of strongly perfect graphs |
scientific article; zbMATH DE number 3906538 |
Statements
A class of strongly perfect graphs (English)
0 references
1985
0 references
It is shown that graphs which do not have more than 3 mutually uncomparable vertices for the vicinal preorder are strongly perfect. Answering to a question of the author, \textit{N. V. R. Mahadev} [Ph. D. Thesis, Waterloo (Ontario) 1984] has later shown that such graphs are moreover perfectly orderable.
0 references
strongly perfect graph
0 references
Dilworth number
0 references
vicinal preorder
0 references
