A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:22, 3 February 2024
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
