Feasible Graphs and Colorings (Q4844508)
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 790838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasible Graphs and Colorings |
scientific article; zbMATH DE number 790838 |
Statements
Feasible Graphs and Colorings (English)
0 references
13 December 1995
0 references
polynomial time coloring
0 references
recursive graph
0 references
recursive \(k\)-coloring
0 references
polynomial time graphs
0 references
exponential time coloring
0 references
0.8104207515716553
0 references
0.8000958561897278
0 references
0.7857465744018555
0 references
0.7802212834358215
0 references
