(https://houseofgraphs.org), which was completely rebuilt from scratch,
through this mailing list.
The House of Graphs hosts complete lists of graphs of various graph
classes (such as cographs, cubic graphs, fullerenes, hypohamiltonian
graphs, snarks, trees,...). But its main feature is a searchable
database of so called "interesting" graphs. That includes graphs that
already occurred as counterexamples to conjectures or as extremal graphs
or in other contexts.
The key idea is that although already for small orders extremely many
graphs exist, there are some that serve again and again as
counterexamples or as extremal graphs and that it would be good to
establish a database of such graphs. This was the main reason why we
started with the development of the House of Graphs back in 2010. In
this database one can e.g. search for graphs with certain invariant
values, graphs with a certain name (e.g. Petersen, Heawood, Coxeter,
etc.) or graphs that are marked as being "interesting" for a certain
invariant (e.g. marked as being interesting for the chromatic number).
These searches can of course also be combined and the results can be
downloaded so that one gets good candidates for testing new conjectures
one is working on.
An important feature is that users can add graphs to the database. If
the graphs are not yet in the database, the system computes invariant
values for the graphs and stores them in the database. So the database
can also be used as a repository. If you discover new interesting
graphs, you can make them available to users by submitting them to the
database together with a text identifier (e.g.
counterexample_this_conjecture) or by referring to their HoG graph id.
Then other scientists can find and download the graph from the House of
Graphs.
Over the years, several new features and invariants were added to the
House of Graphs and users uploaded many interesting graphs to the
website. But as the development of the original House of Graphs website
started in 2010, the underlying frameworks and technologies of the
website became outdated. This is why in 2021-2022, the House of Graphs
was rebuilt completely and was launched in September 2022. Through this
mail we would like to inform you that since the launch of the new
website last year several new features have been added, including:
- Added support to search for graphs with an odd or even value for a
given invariant.
- Added support to search for graphs by entering a formula (e.g. search
for graphs for which |Aut(G)| >= |V(G)|).
- Added support to search for graphs which (do not) contain a given
graph as (induced) subgraph.
- Graphs are now automatically linked with their line graph or
complement (if present in the database).
- It is now possible to sort the search results on a column of your choice.
- Improvements to the graph editor: it is now possible to apply several
embedding heuristics and to mirror or rotate the drawings.
More information on the House of Graphs (including a video tutorial) can
be found on https://houseofgraphs.org
and in:
K. Coolsaet, S. D'hondt and J. Goedgebeur, House of Graphs 2.0: A
database of interesting graphs and more, Discrete Applied Mathematics,
325:97-107, 2023.
Available online: https://doi.org/10.1016/j.dam.2022.10.013
Or on arXiv: https://arxiv.org/abs/2210.17253
--
Jan Goedgebeur
Department of Computer Science
KU Leuven Campus Kulak
Etienne Sabbelaan 53
8500 Kortrijk, Belgium
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
