singleton graph | 2-path graph | 3-path graph | square graph | 4-path graph | 5-path graph | domino graph | 6-path graph | 7-path graph | cubical graph | 4-ladder graph | 8-path graph | (3, 3)-grid graph | 9-path graph | 5-ladder graph | 10-path graph | 11-path graph | (3, 4)-grid graph | (2, 2, 3)-grid graph | 6-ladder graph | ... (total: 117)

0-hypercube graph | 0-Pell graph | 0-triangular grid graph | (1, 0)-permutation star graph | (1, 1, 1, 1)-grid graph | (1, 1, 1)-grid graph | (1, 1)-antelope graph | (1, 1)-bishop graph | (1, 1)-black bishop graph | (1, 1)-camel graph | ...

0-Dorogovtsev-Goltsev-Mendes graph | (1, 1, 2)-grid graph | (1, 1)-bipartite (0, 2)-graph | (1, 1)-complete bipartite graph | (1, 1)-Sierpiński simplex graph | (1, 1)-spoke graph | (1, 1)-stacked book graph | (1, 2)-bar graph | (1, 2)-Hamming graph | (1, 2)-king graph | ...

(1, 1, 3)-grid graph | (1, 2)-complete 2-partite graph | (1, 2)-complete bipartite graph | (1, 2)-Sierpiński simplex graph | (1, 3, 1)-quasi-regular graph | (1, 3)-king graph | (1, 3)-KP graph | 1-tree (3, 1) | (2, 1)-spoke graph | (2, 1)-stacked book graph | ...

(1, 2, 2)-grid graph | (1, 2)-stacked book graph | (1, 4, 1)-honeycomb toroidal graph | (1, 4, 3)-honeycomb toroidal graph | (1, 4)-KC graph | 1-book graph | 1-polyomino graph 1 | (2, 1)-bipartite (0, 2)-graph | (2, 1)-Goethals-Seidel block design graph | (2, 2)-bar graph | ...

(1, 1, 4)-grid graph | (1, 3)-spoke graph | (1, 4)-king graph | (1, 4)-KP graph | 1-tree (4, 1) | (2, 2)-firecracker graph | (2, 4)-black bishop graph | (2, 4)-white bishop graph | 2-centipede graph | 2-shuffle-exchange graph | ...

(1, 1, 5)-grid graph | (1, 3)-Sierpiński simplex graph | (1, 4)-spoke graph | (1, 5)-king graph | (1, 5)-KP graph | 1-tree (5, 1) | (2, 2)-spoke graph | (2, 5)-black bishop graph | (2, 5)-white bishop graph | 4-matchstick graph 5 | ...

(1, 2, 3)-grid graph | (1, 3)-stacked book graph | (2, 2)-stacked book graph | (2, 3)-grid graph | (2, 3)-KP graph | 2-book graph | 2-polyomino graph 1 | (3, 2)-bar graph | 3-ladder graph | (6, 4)-uniquely hamiltonian graph | ...

(1, 1, 6)-grid graph | (1, 5)-spoke graph | (1, 6)-king graph | (1, 6)-KP graph | 1-tree (6, 1) | (2, 6)-black bishop graph | (2, 6)-white bishop graph | 5-matchstick graph 12 | 6-graph 50 | (6)-grid graph | ...

(1, 1, 7)-grid graph | (1, 7)-king graph | (1, 7)-KP graph | 1-tree (7, 11) | (2, 3)-spoke graph | (2, 7)-black bishop graph | (2, 7)-white bishop graph | 6-matchstick graph 28 | 7-graph 372 | (7)-grid graph | 7-tree 11

11-Haar graph | 13-Haar graph | 14-Haar graph | (1, 8, 3)-honeycomb toroidal graph | (1, 8, 5)-honeycomb toroidal graph | (2, 2, 2)-grid graph | (2, 4, 2)-honeycomb toroidal graph | (2, 4, 4)-honeycomb toroidal graph | (2, 4)-KC graph | (2, 4)-rook complement graph | ...

| vertex count | edge count | connected component count singleton graph | 1 | 0 | 1 2-path graph | 2 | 1 | 1 3-path graph | 3 | 2 | 1 square graph | 4 | 4 | 1 4-path graph | 4 | 3 | 1 5-path graph | 5 | 4 | 1 domino graph | 6 | 7 | 1 6-path graph | 6 | 5 | 1 7-path graph | 7 | 6 | 1 cubical graph | 8 | 12 | 1

bicolorable | bipartite | class 1 | connected | grid | Meyniel | perfect | quadratically embeddable | simple | traceable | triangle-free | uniquely colorable | unit-distance | weakly perfect