Slim graphs (Q1123217): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01788666 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4247754217 / rank | |||
Normal rank | |||
Latest revision as of 09:43, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Slim graphs |
scientific article |
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
