singleton graph | 2-empty graph | 2-path graph | 3-empty graph | 3-path graph | 4-empty graph | 4-path graph | butterfly graph | 5-empty graph | 5-path graph | cis-square with two triangles | 6-empty graph | 6-path graph | 7-empty graph | 7-path graph | (4, 4)-black bishop graph | 8-empty graph | (4, 3)-erected polygon graph | 8-path graph | (3, 6)-black bishop graph | ... (total: 106)

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 | ...

(1, 2)-bishop graph | (1, 2)-camel graph | (1, 2)-fiveleaper graph | (1, 2)-giraffe graph | (1, 2)-knight graph | (1, 2)-rook complement graph | (1, 2)-zebra graph | (1, 3)-black bishop graph | (1, 4)-black bishop graph | (1, 4)-white bishop 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, 3)-bishop graph | (1, 3)-camel graph | (1, 3)-fiveleaper graph | (1, 3)-giraffe graph | (1, 3)-knight graph | (1, 3)-rook complement graph | (1, 3)-zebra graph | (1, 5)-black bishop graph | (1, 6)-black bishop graph | (1, 6)-white bishop 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, 4)-bishop graph | (1, 4)-camel graph | (1, 4)-fiveleaper graph | (1, 4)-giraffe graph | (1, 4)-knight graph | (1, 4)-rook complement graph | (1, 4)-zebra graph | (1, 7)-black bishop graph | (1, 8)-black bishop graph | (1, 8)-white bishop 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 | ...

(2, 3)-Dutch windmill graph | (2, 3)-windmill graph | 2-friendship graph | (3, 3)-black bishop graph | 5-graph 23 | 5-triangular snake graph | 6-matchstick graph 3 | bowtie graph | smallest fully forested 5-graph 2

(1, 10)-black bishop graph | (1, 10)-white bishop graph | (1, 11)-white bishop graph | (1, 5)-bishop graph | (1, 5)-camel graph | (1, 5)-fiveleaper graph | (1, 5)-giraffe graph | (1, 5)-knight graph | (1, 5)-rook complement graph | (1, 5)-zebra 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 | ...

| vertex count | edge count | connected component count singleton graph | 1 | 0 | 1 2-empty graph | 2 | 0 | 2 2-path graph | 2 | 1 | 1 3-empty graph | 3 | 0 | 3 3-path graph | 3 | 2 | 1 4-empty graph | 4 | 0 | 4 4-path graph | 4 | 3 | 1 butterfly graph | 5 | 6 | 1 5-empty graph | 5 | 0 | 5 5-path graph | 5 | 4 | 1

black bishop | class 1 | claw-free | line graphs | perfect | simple | weakly perfect