House of Graphs: a database of interesting graphs
From MaRDI portal
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.
Recommendations
Cited in
(80)- Polaritons and excitons: Hamiltonian design for enhanced coherence
- Total dual dyadicness and dyadic generating sets
- Regular graphs with large Italian domatic number
- Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width
- On bounding the difference between the maximum degree and the chromatic number by a constant
- Zen and the art of database maintenance
- On different versions of the exact subgraph hierarchy for the stable set problem
- scientific article; zbMATH DE number 1979259 (Why is no real title available?)
- Quantum walks as thermalisations, with application to fullerene graphs
- Colouring graphs with no induced six-vertex path or diamond
- Self-Dual Polyhedral Cones and Their Slack Matrices
- Existence of regular nut graphs and the fowler construction
- Rotationally symmetric snarks from voltage graphs
- scientific article; zbMATH DE number 7684688 (Why is no real title available?)
- Cubic graphs with colouring defect 3
- Quest for graphs of Frank number 3
- Considerations for future designers of general purpose graph software
- Vertex and edge orbits in nut graphs
- The Open Graph Archive: a community-driven effort
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- On 2-factors splitting an embedded graph into two plane graphs
- Computational results and new bounds for the circular flow number of snarks
- On essentially 4-edge-connected cubic bricks
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- Snarks with special spanning trees
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs
- A practical algorithm for the computation of the genus
- Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
- The smallest nontrivial snarks of oddness 4
- DiscreteZOO: a fingerprint database of discrete objects
- On prisms, Möbius ladders and the cycle space of dense graphs
- Sizes of pentagonal clusters in fullerenes
- Integer sequence discovery from small graphs
- Graphs with few Hamiltonian cycles
- On sensitivity in bipartite Cayley graphs
- A note on the smallest connected non-traceable cubic bipartite planar graph
- Existence of regular nut graphs for degree at most 11
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Exploring the role of graph spectra in graph coloring algorithm performance
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- Obstructions for three-coloring and list three-coloring \(H\)-free graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
- Secure sets and their expansion in cubic graphs
- Perfect Italian domination on planar and regular graphs
- Unrooted non-binary tree-based phylogenetic networks
- Morphology of small snarks
- The 6-girth-thickness of the complete graph
- \texttt{Findstat} -- a database and search engine for combinatorial statistics and maps
- House of Graphs
- The 4-girth-thickness of the complete multipartite graph
- Generation and properties of snarks
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- The minimality of the Georges-Kelmans graph
- A unified approach to construct snarks with circular flow number 5
- A model for finding transition-minors
- Introducing Loopedia
- Towards objective measures of algorithm performance across instance space
- Improved bounds for hypo-Hamiltonian graphs
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- \(k\)-critical graphs in \(P_5\)-free graphs
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- On 12-regular nut graphs
- Structural and computational results on platypus graphs
- Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
- A faster test for 4-flow-criticality in snarks
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Recursive generation of IPR fullerenes
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- \(P_3\)-hull number of graphs with diameter two
- Switching 3-edge-colorings of cubic graphs
- Planar Hypohamiltonian Graphs on 40 Vertices
- DiscreteZOO: towards a fingerprint database of discrete objects
- On the smallest snarks with oddness 4 and connectivity 2
- House of graphs 2.0: a database of interesting graphs and more
- Critical and flow-critical snarks coincide
- A counterexample to the pseudo 2-factor isomorphic graph conjecture
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
This page was built for publication: House of Graphs: a database of interesting graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759891)
