Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs

Almost all n-dimensional rectangular lattices are Hamilton-Laceable

Gustavus J. Simmons · 1977 · 60 citations

Discrete Geometry, Lattice (Order), N-dimensional Rectangular Lattices +2

One‐legged caterpillars span hypercubes

Ivan M. Havel, Petr Liebl · Journal of Graph Theory · 1986 · 39 citations

Maximum Degree 3, N Vertices, Terrestrial Arthropod +4

Spanning subgraphs of a hypercube iii: meshes

Frank Harary, Martin Lewinter · International Journal of Computer Mathematics · 1988 · 18 citations

N Paths, Geometric Graph Theory, Discrete Geometry +15

Spanning subgraphs of a hypercube IV: Rooted trees

Frank Harary, Martin Lewinter · Mathematical and Computer Modelling · 1993 · 10 citations

Network Science, Graph Theory, Engineering +8