Communication: House of Graphs: A database of interesting graphs

Authors:
Gunnar Brinkmann;Kris Coolsaet;Jan Goedgebeur;Hadrien MéLot
Affiliations:
Applied Mathematics & Computer Science, Ghent University, Krijgslaan 281-S9, 9000 Ghent, Belgium;Applied Mathematics & Computer Science, Ghent University, Krijgslaan 281-S9, 9000 Ghent, Belgium;Applied Mathematics & Computer Science, Ghent University, Krijgslaan 281-S9, 9000 Ghent, Belgium;Institut d'Informatique, Université de Mons, Place du Parc, 20, 7000 Mons, Belgium
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 5
Cited 2

Fast generation of cubic graphs

Journal of Graph Theory
Isomorph-free exhaustive generation

Journal of Algorithms
The advantages of forward thinking in generating rooted and free trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast generation of regular graphs and construction of cages

Journal of Graph Theory
Facet defining inequalities among graph invariants: The system GraPHedron

Discrete Applied Mathematics

On prisms, Möbius ladders and the cycle space of dense graphs

European Journal of Combinatorics
Towards objective measures of algorithm performance across instance space

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

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 have 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.