Robinson, R.W.; Wormald, N.C. (1994), “Almost all regular graphs are Hamiltonian”, Random Structures and Algorithms5 (2): 363–374, doi:10.1002/rsa.3240050209.
Petersen, Julius Peter Christian (1891), “Die Theorie der regulären Graphs (The theory of regular graphs)”, Acta Mathematica15 (15): 193–220, doi:10.1007/BF02392606.
Esperer, Louis; Kardoš, František; King, Andrew D.; Král, Daniel; Norine, Serguei (2011), “Exponentially many perfect matchings in cubic graphs”, Advances in Mathematics227 (4): 1646–1664, doi:10.1016/j.aim.2011.03.015.
Iwama, Kazuo; Nakashima, Takuya (2007), “An Improved Exact Algorithm for Cubic Graph TSP”, Computing and Combinatorics, Lecture Notes in Computer Science, 4598, Springer-Verlag, pp. 108–117, doi:10.1007/978-3-540-73545-8_13, ISBN978-3-540-73544-1.
Petersen, Julius Peter Christian (1891), “Die Theorie der regulären Graphs (The theory of regular graphs)”, Acta Mathematica15 (15): 193–220, doi:10.1007/BF02392606.
Esperer, Louis; Kardoš, František; King, Andrew D.; Král, Daniel; Norine, Serguei (2011), “Exponentially many perfect matchings in cubic graphs”, Advances in Mathematics227 (4): 1646–1664, doi:10.1016/j.aim.2011.03.015.