squaregraph
plane graph whose inner faces are 4-cycles and whose inner nodes have degree at least 4
acyclic graph
undirected graph having no graph cycles that may be connected or non-connected
ladder graph
planar undirected graph with 2n vertices and 3n-2 edges; the Cartesian product of two path graphs, one of which has only one edge
lattice graph
graph that can be drawn within a repeating arrangement of points