Colouring perfect graphs with bounded clique number (Q345123)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6656189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Colouring perfect graphs with bounded clique number |
scientific article; zbMATH DE number 6656189 |
Statements
Colouring perfect graphs with bounded clique number (English)
0 references
25 November 2016
0 references
colouring algorithm
0 references
perfect graph
0 references
balanced skew partition
0 references
0.8342939615249634
0 references
0.825651228427887
0 references
