On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:48, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs |
scientific article |
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
