Coloring the Maximal Cliques of Graphs (Q4652597)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2139139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring the Maximal Cliques of Graphs |
scientific article; zbMATH DE number 2139139 |
Statements
Coloring the Maximal Cliques of Graphs (English)
0 references
28 February 2005
0 references
clique-coloring
0 references
hypergraph
0 references
perfect graph
0 references
chromatic number
0 references
domination number
0 references
polynomial algorithms
0 references
NP-completeness
0 references
0.97112375
0 references
0.9320324
0 references
0 references
0.9303285
0 references
0 references
0 references
0.92491204
0 references
0 references
0.9220135
0 references
0.9202541
0 references
