On coloring problems with local constraints (Q5891093)
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: On coloring problems with local constraints |
scientific article; zbMATH DE number 6189816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On coloring problems with local constraints |
scientific article; zbMATH DE number 6189816 |
Statements
On coloring problems with local constraints (English)
0 references
19 July 2013
0 references
clique trees
0 references
computational complexity
0 references
graph coloring problems
0 references
unit interval graphs
0 references
complexity results
0 references
graph coloring problem
0 references
perfect graphs
0 references
precoloring extension problem
0 references
plynomial time algorithms
0 references
0.986749827861786
0 references
0.8273751139640808
0 references
0.8184762001037598
0 references
0.7937183380126953
0 references
