Graph Path
singleton graph | 2-path graph | 3-path graph | 4-path graph | 5-path graph | 6-path graph | 7-path graph | 8-path graph | 9-path graph | 10-path graph | 11-path graph | 12-path graph | 13-path graph | 14-path graph | 15-path graph | 16-path graph | 17-path graph | 18-path graph | 19-path graph | 20-path graph (total: 20)
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, 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, 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
(1, 1, 8)-grid graph | (1, 8)-king graph | (1, 8)-KP graph | 1-tree (8, 1) | (2, 8)-black bishop graph | (2, 8)-white bishop graph | 7-matchstick graph 74 | 8-graph 1284 | (8)-grid graph | 8-tree 1
(1, 1, 9)-grid graph | (1, 4)-Sierpiński simplex graph | (1, 9)-king graph | (1, 9)-KP graph | 1-tree (9, 1) | (2, 4)-spoke graph | (2, 9)-black bishop graph | (2, 9)-white bishop graph | 8-matchstick graph 207 | 9-graph 31013 | ...
10-graph 190066 | (10)-grid graph | 10-tree 1 | (1, 10)-king graph | (1, 10)-KP graph | (1, 1, 10)-grid graph | 1-tree (10, 1) | (2, 10)-black bishop graph | (2, 10)-white bishop graph | 9-matchstick graph 633
| vertex count | edge count | connected component count singleton graph | 1 | 0 | 1 2-path graph | 2 | 1 | 1 3-path graph | 3 | 2 | 1 4-path graph | 4 | 3 | 1 5-path graph | 5 | 4 | 1 6-path graph | 6 | 5 | 1 7-path graph | 7 | 6 | 1 8-path graph | 8 | 7 | 1 9-path graph | 9 | 8 | 1 10-path graph | 10 | 9 | 1
acyclic | apex | bicolorable | bipartite | black bishop | block | cactus | caterpillar | chordal | chordless | class 1 | claw-free | connected | distance-hereditary | forest | geodetic | graceful | grid | KP | k-tree | line graphs | linklessly embeddable | lobster | map | matchstick | median | Meyniel | outerplanar | path | perfect | planar | projective planar | pseudoforest | pseudotree | Ptolemaic | quadratically embeddable | simple | square-free | traceable | tree | triangle-free | uniquely colorable | uniquely embeddable | unit-distance | weakly perfect | white bishop
| complement graph name singleton graph | singleton graph 2-path graph | 2-empty graph 3-path graph | 2-path and singleton 4-path graph | 4-path graph 5-path graph | house graph
| line graph name singleton graph | null graph 2-path graph | singleton graph 3-path graph | 2-path graph 4-path graph | 3-path graph 5-path graph | 4-path graph