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… (More)