Slim graphs (Q1123217)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4108827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Slim graphs |
scientific article; zbMATH DE number 4108827 |
Statements
Slim graphs (English)
0 references
1989
0 references
The author investigates Slim graphs which can be obtained by deleting in a Meyniel graph G all the edges induced by an arbitrary set of nodes. Besides proving that Slim graphs are perfect a simple proof of the conjecture is given that Meyniel graphs are locally perfect graphs.
0 references
strong perfect graph conjecture
0 references
Slim graphs
0 references
Meyniel graphs
0 references
locally perfect graphs
0 references
0.8802748322486877
0 references
0.877898633480072
0 references
0.7683266401290894
0 references
