Perfect graphs with no balanced skew-partition are 2-clique-colorable (Q2800540)
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 with no balanced skew-partition are 2-clique-colorable |
scientific article; zbMATH DE number 6569674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect graphs with no balanced skew-partition are 2-clique-colorable |
scientific article; zbMATH DE number 6569674 |
Statements
15 April 2016
0 references
strong perfect graph theorem
0 references
clique-chromatic number
0 references
Perfect graphs with no balanced skew-partition are 2-clique-colorable (English)
0 references
0.8262133598327637
0 references
0.825651228427887
0 references
0.799109697341919
0 references
0.7723999619483948
0 references
