A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this
paper, the s-regular elementary abelian coverings of the complete bipartite graph K3, 3 and …

Abstract Let CG (X) be the set of all (equivalence classes of) regular covering projections of
a given connected graph X along which a given group G≤ Aut X of automorphisms lifts …

A list is given of all semisymmetric (edge-but not vertex-transitive) connected finite cubic
graphs of order up to 768. This list was determined by the authors using Goldschmidt's …

A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In
this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for …

A graph covering projection, also known as a locally bijective homomorphism, is a mapping
between vertices and edges of two graphs which preserves incidencies and is a local …

A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of
vertices. The characterisation is then applied to solve several problems in the area of edge …

Quite a lot of attention has been paid recently to the construction of edge-or arc-transitive
covers of symmetric graphs. In most cases, the approach has involved voltage graph …

We initiate the study of computational complexity of graph coverings, aka locally bijective
graph homomorphisms, for graphs with semi-edges. The notion of graph covering is a …

Using covering graph techniques, a structural result about connected cubic simple graphs
admitting an edge-transitive solvable group of automorphisms is proved. This implies …

Some recent discoveries about half-arc-transitive graphs Page 1 Also available at http://amc-journal.eu
ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA …