triangle-free graph
undirected graph in which no three vertices form a triangle of edges
bipartite graph
graph whose vertices can be divided into two disjoint and independent sets
Wagner graph
cubic graph with 8 vertices and 12 edges
Gewirtz graph
strongly regular graph with 56 vertices and valency 10
Harries graph
3-regular undirected graph with 70 vertices and 105 edges