Cameron, Peter J. There are only finitely many finite distance-transitive graphs of given valency greater than two. (English) Zbl 0507.05037 Combinatorica 2, 9-13 (1982). MSC: 05C25 20B25 PDFBibTeX XMLCite \textit{P. J. Cameron}, Combinatorica 2, 9--13 (1982; Zbl 0507.05037) Full Text: DOI
Dunwoody, M. J. Cutting up graphs. (English) Zbl 0504.05035 Combinatorica 2, 15-23 (1982). MSC: 05C25 20E06 05C40 PDFBibTeX XMLCite \textit{M. J. Dunwoody}, Combinatorica 2, 15--23 (1982; Zbl 0504.05035) Full Text: DOI
Margulis, G. A. Explicit constructions of graphs without short cycles and low density codes. (English) Zbl 0492.05044 Combinatorica 2, 71-78 (1982). MSC: 05C35 05C38 94B05 05C25 20H05 PDFBibTeX XMLCite \textit{G. A. Margulis}, Combinatorica 2, 71--78 (1982; Zbl 0492.05044) Full Text: DOI