Perfect graphs, partitionable graphs and cutsets (Q700371)
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: Perfect graphs, partitionable graphs and cutsets |
scientific article; zbMATH DE number 1817725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect graphs, partitionable graphs and cutsets |
scientific article; zbMATH DE number 1817725 |
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
0.8043689131736755
0 references
0.7960506677627563
0 references
0.7960506677627563
0 references
0.792625367641449
0 references
0.7861446142196655
0 references
