House of Graphs: a database of interesting graphs

Abstract

In this note we present House of Graphs (http://hog.grinvin.org) which is a new database of graphs. The key principle is to have a searchable database and offer -- next to complete lists of some graph classes -- also a list of special graphs that already turned out to be interesting and relevant in the study of graph theoretic problems or as counterexamples to conjectures. This list can be extended by users of the database.

8 pages; added a figure

Cited by in corpus (48)

• Generation and Properties of Snarks
• House of Graphs 2.0: a database of interesting graphs and more
• Recursive generation of IPR fullerenes
• Finite sets of operations sufficient to construct any fullerene from $C_{20}$
• Generation of cubic graphs and snarks with large girth
• Improved bounds for hypohamiltonian graphs
• Graphs with few Hamiltonian Cycles
• Unravelling Graph-Exchange File Formats
• Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
• Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
• A new record of graph enumeration enabled by parallel processing
• Generation and properties of nut graphs
• DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting
• Obstructions for three-coloring graphs without induced paths on six vertices
• Scheme for constructing graphs associated with stabilizer quantum codes
• Digenes: genetic algorithms to discover conjectures about directed and undirected graphs
• On prisms, Möbius ladders and the cycle space of dense graphs
• Optimal Low-Latency Network Topologies for Cluster Performance Enhancement
• On essentially 4-edge-connected cubic bricks
• The Minimality of the Georges-Kelmans Graph
• Fullerenes with distant pentagons
• Integer sequence discovery from small graphs
• Bounds for the smallest $k$-chromatic graphs of given girth
• Exhaustive generation of $k$-critical $\mathcal{H}$-free graphs
• A counterexample to the pseudo 2-factor isomorphic graph conjecture
• Quantum walks as thermalizations, with application to fullerene graphs
• On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
• Load-balanced Routing for Nested Interconnection Networks
• Obstructions for three-coloring and list three-coloring $H$-free graphs
• The 6-girth-thickness of the complete graph
• New Computational Upper Bounds for Ramsey Numbers R(3,k)
• Self-dual polyhedral cones and their slack matrices
• The 4-girth-thickness of the complete multipartite graph
• Some Results on $k$-Critical $P_5$-Free Graphs
• $k$-Critical Graphs in $P_5$-Free Graphs
• An algorithm and new bounds for the circular flow number of snarks
• Avoidable Vertices and Edges in Graphs
• Cyclic pseudo-{L}oupekine snarks
• Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
• Automated Conjecturing VII: The Graph Brain Project & Big Mathematics
• On almost hypohamiltonian graphs
• On 4-critical t-perfect graphs
• A new approach to catalog small graphs of high even girth
• On the genera of polyhedral embeddings of cubic graph
• On bounding the difference between the maximum degree and the chromatic number by a constant
• Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes
• New bounds for Ramsey numbers $R(K_k-e,K_l-e)$
• A survey of repositories in graph theory