perfect graph
graph whose maximum clique’s size equals the chromatic number
cricket graph
graph with 5 vertices and 5 edges
Herschel graph
bipartite undirected graph
octahedral graph
polyhedral graph of the octahedron, with 6 vertices and 12 edges
edgeless graph
graph without edges (on any number of vertices)
house graph
graph with 5 vertices and 6 edges
barbell graph
type of undirected graph consisting of two non-overlapping n-vertex cliques together with a single edge that has an endpoint in each clique
bipartite graph
graph whose vertices can be divided into two disjoint and independent sets
Folkman graph
graph with 20 vertices and 40 edges, the smallest semi-symmetric graph
perfectly orderable graph
special case of the perfect graphs in graph theory
Ptolemaic graph
graph that is both chordal and distance-hereditary
Hanoi graph
graph representing the possible states of the Tower of Hanoi puzzle
interval graph
intersection graph of a collection of intervals of the real line
Hoffman graph
4-regular graph with 16 vertices and 32 edges
rook's graph
graph that represents all legal moves of the rook chess piece on a chessboard
bishop's graph
graph that represents all legal moves of the bishop on a chessboard
weakly chordal graph
graph free of holes and anti-holes
truncated tetrahedral graph
graph with 12 vertices and 18 edges