Computational Complexity of Covering Three-Vertex Multigraphs (Q2922636): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:13, 3 February 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
14 October 2014
0 references
computational complexity
0 references
graph homomorphism
0 references
covering projection
0 references