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 14 articles , 1 standard article )

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

  1. Fiol, M. A.; Mazzuoccolo, G.; Steffen, E.: Measures of edge-uncolorability of cubic graphs (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. Szöllősi, Ferenc; Östergård, Patric R. J.: Enumeration of Seidel matrices (2018)
  5. Brinkmann, Gunnar; Goedgebeur, Jan: Generation of cubic graphs and snarks with large girth (2017)
  6. Goedgebeur, Jan; Zamfirescu, Carol T.: Improved bounds for hypo-Hamiltonian graphs (2017)
  7. Hoppe, Travis; Petrone, Anna: Integer sequence discovery from small graphs (2016)
  8. Huber, Katharina T.; Moulton, Vincent; Wu, Taoyang: Transforming phylogenetic networks: moving beyond tree space (2016)
  9. Brinkmann, Gunnar; Preissmann, Myriam; Sasaki, Diana: Snarks with total chromatic number 5 (2015)
  10. Goedgebeur, Jan: A counterexample to the pseudo 2-factor isomorphic graph conjecture (2015)
  11. Jesse-Józefczyk, Katarzyna; Sidorowicz, Elżbieta: Secure sets and their expansion in cubic graphs (2014)
  12. Brinkmann, Gunnar; Goedgebeur, Jan; Hägglund, Jonas; Markström, Klas: Generation and properties of snarks (2013)
  13. Brinkmann, Gunnar; Van Cleemput, Nico; Pisanski, Tomaž: Generation of various classes of trivalent graphs (2013)
  14. Brinkmann, Gunnar; Goedgebeur, Jan; Mckay, Brendan D.: Generation of cubic graphs (2011)