Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing clique and chromatic number of circular-perfect graphs in polynomial time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing clique and chromatic number of circular-perfect graphs in polynomial time |
scientific article |
Statements
Computing clique and chromatic number of circular-perfect graphs in polynomial time (English)
0 references
11 November 2013
0 references
circular-perfect graph
0 references
clique number
0 references
chromatic number
0 references
0 references
