Perfect graphs, partitionable graphs and cutsets (Q700371): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59904362, #quickstatements; #temporary_batch_1711626644914 |
Created claim: DBLP publication ID (P1635): journals/combinatorica/ConfortiCGV02, #quickstatements; #temporary_batch_1731461124002 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/combinatorica/ConfortiCGV02 / rank | |||
Normal rank | |||
Latest revision as of 02:43, 13 November 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
