A new lower bound for the inducibility of a graph
Reconstruction of graphs with special degree-sequences
On graphs containing many subgraphs with the same number of edges
An enumeration theorem for rooted graphs
On a problem of P. Erdös
The genera, reflexibility and simplicity of regular maps
This paper uses combinatorial group theory to help answer some long-standing questions about the genera of orientable surfaces that carry particular kinds of regular maps. By classifying all orientably-regular maps whose automorphism group has order coprime to , where is the genus, all orientably-regular maps of genus for prime are determined. As a consequence, it is shown that orientable surfaces of infinitely many genera carry no regular map that is chiral (irreflexible), and that orientable...
Constructing and forbidding automorphisms in lifted maps
Professor Štefan Znám (1936--1993)
Moore graphs and beyond: a survey of the degree/diameter problem.
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments.
Page 1