2-path graph | 3-path graph | claw graph | square graph | 5-star graph | domino graph | 6-star graph | 7-star graph | 3-book graph | 4-ladder graph | 8-star graph | (3, 3)-grid graph | 9-star graph | 4-book graph | 5-ladder graph | 10-star graph | 11-star graph | 5-book graph | (3, 4)-grid graph | 6-ladder graph | ... (total: 109)

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, 3)-complete 2-partite graph | (1, 3)-complete bipartite graph | 1-tree (4, 2) | (3, 1)-Cayley tree | (3, 1)-spoke graph | (3, 1)-stacked book graph | 3-Lucas cube graph | 3-matchstick graph 2 | 4-edge-transitive graph 4 | 4-graph 4 | ...

(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, 4)-complete 2-partite graph | (1, 4)-complete bipartite graph | 1-alkane graph | 1-n-alkane graph | 1-tree (5, 3) | (4, 1)-Cayley tree | (4, 1)-spoke graph | (4, 1)-stacked book graph | 4-matchstick graph 2 | 5-edge-transitive graph 12 | ...

(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, 5)-complete 2-partite graph | (1, 5)-complete bipartite graph | 1-tree (6, 6) | (5, 1)-Cayley tree | (5, 1)-spoke graph | (5, 1)-stacked book graph | 5-matchstick graph 5 | 6-edge-transitive graph 18 | 6-graph 6 | 6-tree 6 | 6-uniquely graceful graph 1

(1, 6)-complete 2-partite graph | (1, 6)-complete bipartite graph | 1-tree (7, 2) | (6, 1)-Cayley tree | (6, 1)-spoke graph | (6, 1)-stacked book graph | 6-matchstick graph 12 | 7-edge-transitive graph 27 | 7-graph 7 | 7-tree 2 | 7-uniquely graceful graph 1

(3, 2)-stacked book graph | 8-graph 5695

10-matchstick graph 1755 | (1, 2, 4)-grid graph | (1, 4)-stacked book graph | (2, 4)-grid graph | (2, 4)-KP graph | 3-polyomino graph 2 | (4, 2)-bar graph | (8, 43)-uniquely hamiltonian graph | 8-graph 3551

| vertex count | edge count | connected component count 2-path graph | 2 | 1 | 1 3-path graph | 3 | 2 | 1 claw graph | 4 | 3 | 1 square graph | 4 | 4 | 1 5-star graph | 5 | 4 | 1 domino graph | 6 | 7 | 1 6-star graph | 6 | 5 | 1 7-star graph | 7 | 6 | 1 3-book graph | 8 | 10 | 1 4-ladder graph | 8 | 10 | 1

bicolorable | bipartite | class 1 | connected | median | Meyniel | nonempty | perfect | quadratically embeddable | simple | stacked book | triangle-free | uniquely colorable | unit-distance | weakly perfect