[2][3] By construction, the ladder graph Ln is isomorphic to the grid graph G2,n and looks like a ladder with n rungs.

It is Hamiltonian with girth 4 (if n>1) and chromatic index 3 (if n>2).

The circular ladder graph CLn is constructible by connecting the four 2-degree vertices in a straight way, or by the Cartesian product of a cycle of length n ≥ 3 and an edge.

Like the ladder graph, it is connected, planar and Hamiltonian, but it is bipartite if and only if n is even.

Circular ladder graphs: Connecting the four 2-degree vertices crosswise creates a cubic graph called a Möbius ladder.