From graph coloring to constraint satisfaction: there and back again (Q3424890)
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 5130826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From graph coloring to constraint satisfaction: there and back again |
scientific article; zbMATH DE number 5130826 |
Statements
5 March 2007
0 references
homomorphism
0 references
retraction
0 references
dichotomy conjecture
0 references
polymorphism
0 references
matrix partition
0 references
trigraph
0 references
perfect graph
0 references
0.8977829813957214
0 references
0.8149863481521606
0 references
0.8124985098838806
0 references
0.7885903716087341
0 references
0.7810811996459961
0 references
