An unrelated family of of graphs known as Johnson graphs are defined as graphs whose vertices
given by the k-subsets of , with two vertices connected iff
their intersection has size .

Owens, P. J. "On Regular Graphs and Hamiltonian Circuits, Including Answers to Some Questions of Joseph Zaks." J. Combin.
Theory, Ser. B28, 262-277, 1980.Zaks, J. "Pairs of
Hamiltonian Circuits in 5-Connected Planar Graphs." J. Combin. Th. Ser. B,
116-131, 1976.