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 this page instead for the normal view: 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
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
