On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514)
From MaRDI portal
!
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 6189790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs |
scientific article; zbMATH DE number 6189790 |
Statements
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (English)
0 references
19 July 2013
0 references
circular-perfect graph
0 references
polytope
0 references
circular-clique number
0 references
circular-chromatic number
0 references
polynomial time computability
0 references
0.9735692739486694
0 references
0.9397542476654052
0 references
0.9301162958145142
0 references
0.9166632294654846
0 references
0.8352246284484863
0 references
