Complexity of conditional colorability of graphs (Q1003864)
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 5523293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of conditional colorability of graphs |
scientific article; zbMATH DE number 5523293 |
Statements
Complexity of conditional colorability of graphs (English)
0 references
4 March 2009
0 references
vertex coloring
0 references
conditional coloring
0 references
(Conditional) chromatic number
0 references
algorithm
0 references
complexity
0 references
\(NP\)-complete
0 references
0 references
0.8489250540733337
0 references
0.8023847341537476
0 references
0.8007736802101135
0 references
