A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831)
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 2235952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results |
scientific article; zbMATH DE number 2235952 |
Statements
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (English)
0 references
7 December 2005
0 references
Computational complexity
0 references
Graph
0 references
Colouring
0 references
Homomorphism
0 references
Retraction
0 references
Compaction
0 references
Partition
0 references
0.9623849987983704
0 references
0.9323290586471558
0 references
0.9306063652038574
0 references
0.8777697086334229
0 references
0.8308380842208862
0 references
