House of Graphs

House of graphs: A database of interesting graphs. In this note we present House of Graphs ( 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.

References in zbMATH (referenced in 25 articles , 1 standard article )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Erokhovets, Nikolai: Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face (2018)
  2. Goedgebeur, Jan: On the smallest snarks with oddness 4 and connectivity 2 (2018)
  3. Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu: Graphs with few Hamiltonian Cycles (2018) arXiv
  4. Bašić, Nino; Brinkmann, Gunnar; Fowler, Patrick W.; Pisanski, Tomaž; Van Cleemput, Nico: Sizes of pentagonal clusters in fullerenes (2017)
  5. Jooyandeh, Mohammadreza; McKay, Brendan D.; Östergård, Patric R. J.; Pettersson, Ville H.; Zamfirescu, Carol T.: Planar hypohamiltonian graphs on 40 vertices (2017)
  6. Šámal, Robert: Cycle-continuous mappings -- order structure (2017)
  7. van Wersch, Rim; Kelk, Steven: ToTo: an open database for computation, storage and retrieval of tree decompositions (2017)
  8. Weil, Vera; Schaudt, Oliver: On bounding the difference between the maximum degree and the chromatic number by a constant (2017)
  9. Brinkmann, Gunnar; Souffriau, Jasper; van Cleemput, Nico: On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations (2016)
  10. Goedgebeur, Jan; Schaudt, Oliver: Exhaustive generation of $k$-critical $\mathcal H$-free graphs (2016)
  11. Hoppe, Travis; Petrone, Anna: Integer sequence discovery from small graphs (2016)
  12. Brinkmann, Gunnar; Preissmann, Myriam; Sasaki, Diana: Snarks with total chromatic number 5 (2015)
  13. Carneiro, André Breda; da Silva, C^andida Nunes; McKay, Brendan: A faster test for 4-flow-criticality in snarks (2015)
  14. Goedgebeur, Jan: A counterexample to the pseudo 2-factor isomorphic graph conjecture (2015)
  15. Goedgebeur, Jan; McKay, Brendan D.: Recursive generation of IPR fullerenes (2015)
  16. Goedgebeur, Jan; McKay, Brendan D.: Fullerenes with distant pentagons (2015)
  17. Heinig, Peter: On prisms, Möbius ladders and the cycle space of dense graphs (2014)
  18. Jesse-Józefczyk, Katarzyna; Sidorowicz, Elżbieta: Secure sets and their expansion in cubic graphs (2014)
  19. Smith-Miles, Kate; Baatar, Davaatseren: Exploring the role of graph spectra in graph coloring algorithm performance (2014)
  20. Smith-Miles, Kate; Baatar, Davaatseren; Wreford, Brendan; Lewis, Rhyd: Towards objective measures of algorithm performance across instance space (2014)

1 2 next