#### Filter Results:

#### Publication Year

1992

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

1 Summary of the review This book is definitely a reference style book that a graduate student might find useful, especially if he/she is working on a combinatorial problem that could benefit from the use of an algebraic tool. 2 Summary of the book This is a collection of 11 surveys on the applications of group theory to combinatorics. The surveys are the… (More)

A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, we classify the s-regular elementary Abelian coverings of the three-dimensional hypercube for each s ≥ 1 whose fibre-preserving automorphism subgroups act arc-transitively. This gives a new infinite family of cubic 1-regular graphs, in which the smallest… (More)

A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. 138] found a relation between cubic 1-regular graphs and tetravalent half-transitive graphs with girth 3 and Alspach et al. constructed infinitely many tetravalent half-transitive graphs with girth 3. Using these results, Miller's construction can be generalized… (More)

By a regular embedding of a graph into an orientable surface we mean a 2-cell embedding with the automorphism group acting regularly on arcs. In 1997 Nedela andŠkoviera [Europ. J. Comb. 18, 807-823] presented a construction giving for each solution of the congruence e 2 ≡ 1(mod n) a regular embedding M e of the hypercube Q n. It was conjectured that all… (More)