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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2004.07.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2004.07.003 / rank | |||
Normal rank | |||
Latest revision as of 08:15, 19 December 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
