Search graph database
Browse collections
-
Cographs
Last updated: 20 Dec 2019 | Contains: 1019755 graphs
A cograph, or complement-reducible graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. The following collection was calculated by Atila A. Jones (source) and lists all connected cographs on up to 15 vertices.
-
Ramsey(3,4) graphs
Last updated: 20 Dec 2019 | Contains: 48 graphs
A Ramsey(s,t) graph is a graph with no clique of size s, and no independent set of size t. The following collection was calculated by Brendan McKay (source) and lists all Ramsey(3,4) graphs.
-
Ramsey(3,5) graphs
Last updated: 20 Dec 2019 | Contains: 1029 graphs
A Ramsey(s,t) graph is a graph with no clique of size s, and no independent set of size t. The following collection was calculated by Brendan McKay (source) and lists all Ramsey(3,5) graphs.
-
Ramsey(3,6) graphs
Last updated: 20 Dec 2019 | Contains: 761692 graphs
A Ramsey(s,t) graph is a graph with no clique of size s, and no independent set of size t. The following collection was calculated by Brendan McKay (source) and lists all Ramsey(3,6) graphs.
-
Edge-transitive graphs
Last updated: 15 Dec 2020 | Contains: 37539 graphs
An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. The following collection was calculated by Lucas Mol (source) and lists all edge-transitive graphs on up to 47 vertices.