Perfect graphs, partitionable graphs and cutsets (Q700371): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004930200001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994475625 / rank | |||
Normal rank | |||
Revision as of 19:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect graphs, partitionable graphs and cutsets |
scientific article |
Statements
Perfect graphs, partitionable graphs and cutsets (English)
0 references
20 October 2002
0 references
The authors prove a theorem about cutsets in partitionable graphs. It generalizes earlier results on amalgams, 2-amalgams and homogeneous pairs and is applied to prove the strong perfect graph conjecture for a class of graphs containing Meyniel graphs, line graphs and bipartite graphs.
0 references
perfect graphs
0 references
