Alon, N., Benjamini, I., Lubetzky, E. and Sodin, S. (2007) Non-backtracking random walks mix faster. Commun. Contemp. Math. 9 585–603.
Amit, A. and Linial, N. (2002) Random graph coverings I: General theory and graph connectivity. Combinatorica 22 1–18.
Amit, A. and Linial, N. (2006) Random lifts of graphs: Edge expansion. Combin. Probab. Comput. 15 317–332.
Amit, A., Linial, N. and Matoušek, J. (2002) Random lifts of graphs: Independence and chromatic number. Random Struct. Alg. 20 1–22.
Angel, O., Friedman, J. and Hoory, S. The non-backtracking spectrum of the universal cover of a graph. Preprint; available as arXiv:0712.0192v1 [math.CO].
Burgin, K., Chebolu, P., Cooper, C. and Frieze, A. M. (2006) Hamilton cycles in random lifts of graphs. Europ. J. Combin. 27 1282–1293.
Chebolu, P. and Frieze, A. M. (2008) Hamilton cycles in random lifts of complete directed graphs. SIAM J. Discrete Math. 22 520–540.
Greenhill, C., Janson, S., Kim, J. H. and Wormald, N. C. (2002) Permutation pseudographs and contiguity. Combin. Probab. Comput. 11 273–298.
Friedman, J. (2008) A proof of Alon's second eigenvalue conjecture. Memoirs Amer. Math. Soc. 195 no. 910.
Horton, M. D., Stark, H. M. and Terras, A. A. (2008) Zeta functions of weighted graphs and covering graphs. In Analysis on Graphs and its Applications, Vol. 77 of Proc. Sympos. Pure Math., AMS, Providence, RI, pp. 29–50.
Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley, New York.
Linial, N. and Rozenman, E. (2005) Random lifts of graphs: Perfect matchings. Combinatorica 25 407–424.
Oren, I., Godel, A. and Smilansky, U. (2009) Trace formulae and spectral statistics for discrete Laplacians on regular graphs I. J. Phys. A: Math. Theor. 42 415101.
McMullen, P. (1984) Determinants of lattices induced by rational subspaces. Bull. London Math. Soc. 16 275–277.
Molloy, M. S. O., Robalewska, H., Robinson, R. W. and Wormald, N. C. (1997) 1-factorizations of random regular graphs. Random Struct. Alg. 10 305–321.
Robinson, R. W. and Wormald, N. C. (1984) Existence of long cycles in random cubic graphs. In Enumeration and Design (Jackson, D. M. and Vanstone, S. A., eds), Academic Press, Toronto, pp. 251–270.
Robinson, R. W. and Wormald, N. C. (1992) Almost all cubic graphs are Hamiltonian. Random Struct. Alg. 3 117–125.
Robinson, R. W. and Wormald, N. C. (1994) Almost all regular graphs are Hamiltonian. Random Struct. Alg. 5 363–374.
Schnell, U. (1992) Minimal determinants and lattice inequalities. Bull. London Math. Soc. 24 606–612.