On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2009.11.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2009.11.010 / rank | |||
Normal rank | |||
Latest revision as of 00:45, 20 December 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
