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; zbMATH DE number 6225218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing clique and chromatic number of circular-perfect graphs in polynomial time |
scientific article; zbMATH DE number 6225218 |
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
0.969917058944702
0 references
0.9301162958145142
0 references
0.915262758731842
0 references
0.8847407698631287
0 references
0.8770252466201782
0 references
