A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Algorithmic Aspects of Regular Graph Covers
[article]
2017
arXiv
pre-print
A graph G covers a graph H if there exists a locally bijective homomorphism from G to H. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of Aut(G). We study computational aspects of regular covers that have not been addressed before. The decision problem RegularCover asks for given graphs G and H whether G regularly covers H. When |H|=1, this problem becomes Cayley graph recognition for which the complexity is still unresolved. Another
arXiv:1609.03013v2
fatcat:6r7hqzcekzaldlbt2vzq7x2ap4