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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2004.07.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051028069 / rank | |||
Normal rank | |||
Revision as of 20:45, 19 March 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
