On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.11.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023441208 / rank | |||
Normal rank | |||
Revision as of 21:10, 19 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
