House of graphs 2.0: a database of interesting graphs and more

DOI10.1016/j.dam.2022.10.013OpenAlexW4307933731MaRDI QIDQ2104929

Sven D'hondt, Jan Goedgebeur, Kris Coolsaet

Publication date: 8 December 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.17253

zbMATH Keywords

graph drawinggraph invariantgraph databasegraph classcomplete listsgraph generator

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (05C99) Mathematical programming (90Cxx) Theory of computing (68Qxx)

Related Items (6)

Interpretable random forest model for identification of edge 3-uncolorable cubic graphs ⋮ Some results on \(k\)-critical \(P_5\)-free graphs ⋮ On decreasing the orders of \((k,g)\)-graphs ⋮ K₂‐Hamiltonian graphs: II ⋮ House of Graphs ⋮ Colouring graphs with no induced six-vertex path or diamond

Uses Software

• nauty
• SageMath
• GrInvIn
• Traces
• PostgreSQL
• Docker
• GWT
• Slurm
• GraPHedron
• GENREG
• Maven

Cites Work

• Generation and properties of snarks
• Facet defining inequalities among graph invariants: The system graphedron
• GrInvIn in a nutshell
• House of Graphs: a database of interesting graphs
• Positive-instance driven dynamic programming for treewidth
• Practical graph isomorphism. II.
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• Fast generation of regular graphs and construction of cages
• A practical algorithm for the computation of the genus
• How to Break MD5 and Other Hash Functions

This page was built for publication: House of graphs 2.0: a database of interesting graphs and more