Cubic graphs and Snarks: Snarkhunter is a generator for connected cubic graphs and snarks. Snarks are cyclically 4-edge connected cubic graphs with chromatic index 4 and girth at least 4 or 5. New: snarkhunter can now also be used to generate connected cubic graphs and snarks with girth at least k efficiently (for k ≤ 7).

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

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

  1. Seo, Suk J.: Fault-tolerant detectors for distinguishing sets in cubic graphs (2021)
  2. Fowler, Patrick W.; Gauci, John Baptist; Goedgebeur, Jan; Pisanski, Tomaž; Sciriha, Irene: Existence of regular nut graphs for degree at most 11 (2020)
  3. Goedgebeur, Jan; Meersman, Barbara; Zamfirescu, Carol T.: Graphs with few Hamiltonian cycles (2020)
  4. Kamil, I. A.; Sudani, H. H. K.; Lobov, A. A.; Abrosimov, M. B.: Constructing all nonisomorphic supergraphs with isomorphism rejection (2020)
  5. Goedgebeur, Jan; Máčajová, Edita; Škoviera, Martin: Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (2019)
  6. Goedgebeur, Jan; Ozeki, Kenta; Van Cleemput, Nico; Wiener, Gábor: On the minimum leaf number of cubic graphs (2019)
  7. Fiol, M. A.; Mazzuoccolo, G.; Steffen, E.: Measures of edge-uncolorability of cubic graphs (2018)
  8. Goedgebeur, Jan: On the smallest snarks with oddness 4 and connectivity 2 (2018)
  9. Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu: Graphs with few Hamiltonian Cycles (2018) arXiv
  10. Szöllősi, Ferenc; Östergård, Patric R. J.: Enumeration of Seidel matrices (2018)
  11. Brinkmann, Gunnar; Goedgebeur, Jan: Generation of cubic graphs and snarks with large girth (2017)
  12. Goedgebeur, Jan; Zamfirescu, Carol T.: Improved bounds for hypo-Hamiltonian graphs (2017)
  13. Hoppe, Travis; Petrone, Anna: Integer sequence discovery from small graphs (2016)
  14. Huber, Katharina T.; Moulton, Vincent; Wu, Taoyang: Transforming phylogenetic networks: moving beyond tree space (2016)
  15. Brinkmann, Gunnar; Preissmann, Myriam; Sasaki, Diana: Snarks with total chromatic number 5 (2015)
  16. Goedgebeur, Jan: A counterexample to the pseudo 2-factor isomorphic graph conjecture (2015)
  17. Jesse-Józefczyk, Katarzyna; Sidorowicz, Elżbieta: Secure sets and their expansion in cubic graphs (2014)
  18. Brinkmann, Gunnar; Goedgebeur, Jan; Hägglund, Jonas; Markström, Klas: Generation and properties of snarks (2013)
  19. Brinkmann, Gunnar; Van Cleemput, Nico; Pisanski, Tomaž: Generation of various classes of trivalent graphs (2013)
  20. Brinkmann, Gunnar; Goedgebeur, Jan; Mckay, Brendan D.: Generation of cubic graphs (2011)