Search graph database
Browse collections
-
Homeomorphically irreducible trees
Last updated: 15 Dec 2020 | Contains: 1273774 graphs
These are trees with no vertices of degree 2. They are also called series-reduced trees. The following collection was calculated by Brendan McKay (source) and lists all homeomorphically irreducible trees on up to 28 vertices.
-
Tetravalent graphs
Last updated: 15 Dec 2020 | Contains: 906331 graphs
Tetravalent, quartic or 4-regular graphs are graphs where every vertex has degree 4. The following collection was calculated by The House of Graphs (source) and lists all connected tetravalent graphs on up to 15 vertices.
-
Uniquely hamiltonian graphs
Last updated: 15 Dec 2020 | Contains: 142181 graphs
A uniquely hamiltonian graph is a graph which contains exactly one hamiltonian cycle. The following collection was calculated by The House of Graphs (source) and lists all uniquely hamiltonian graphs on up to 10 vertices.