On the complexity of graph coloring with additional local conditions (Q1708276)
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 6856076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of graph coloring with additional local conditions |
scientific article; zbMATH DE number 6856076 |
Statements
On the complexity of graph coloring with additional local conditions (English)
0 references
5 April 2018
0 references
computational complexity
0 references
graph coloring
0 references
fixed-parameter tractability
0 references
0.8594210743904114
0 references
0.8213065266609192
0 references
0.7783822417259216
0 references
0.7708876729011536
0 references
