Computational complexity of covering three-vertex multigraphs (Q897866): 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.tcs.2015.09.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1954345120 / rank | |||
Normal rank | |||
Revision as of 22:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of covering three-vertex multigraphs |
scientific article |
Statements
Computational complexity of covering three-vertex multigraphs (English)
0 references
8 December 2015
0 references
computational complexity
0 references
graph homomorphism
0 references
covering projection
0 references
