nauty

graph-theoretic program NAUTY: nauty is a program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling. nauty is written in a portable subset of C, and runs on a considerable number of different systems. There is a small suite of programs called gtools included in the package. For example, geng can generate non-isomorphic graphs very quickly. There are also generators for bipartite graphs, digraphs, and multigraphs.

This software is also referenced in ORMS.


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

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

1 2 3 ... 16 17 18 next

  1. Bundala, Daniel; Codish, Michael; Cruz-Filipe, Luís; Schneider-Kamp, Peter; Závodný, Jakub: Optimal-depth sorting networks (2017)
  2. Foucart, Simon; Skrzypek, Lesław: On maximal relative projection constants (2017)
  3. Abdesselam, Abdelmalek; Ikenmeyer, Christian; Royle, Gordon: 16,051 formulas for Ottaviani’s invariant of cubic threefolds (2016)
  4. Adamaszek, Anna; Adamaszek, Michal; Mnich, Matthias; Schmidt, Jens M.: Lower bounds for locally highly connected graphs (2016)
  5. Altinakar, Sivan; Caporossi, Gilles; Hertz, Alain: A comparison of integer and constraint programming models for the deficiency problem (2016)
  6. Bonin, Joseph E.; Savitsky, Thomas J.: An infinite family of excluded minors for strong base-orderability (2016)
  7. Cabello, Adán; Kleinmann, Matthias; Portillo, José R.: Quantum state-independent contextuality requires 13 rays (2016)
  8. Cheng, Xi-Ming; Gavrilyuk, Alexander L.; Greaves, Gary R.W.; Koolen, Jack H.: Biregular graphs with three eigenvalues (2016)
  9. Demirkale, Fatih; Donovan, Diane M.; Küçükçifçi, Selda; Yazıcı, Emine Şule: Orthogonal trades and the intersection problem for orthogonal arrays (2016)
  10. Egan, Judith; Wanless, Ian M.: Enumeration of MOLS of small order (2016)
  11. Fampa, Marcia; Lee, Jon; Melo, Wendel: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in $n$-space (2016)
  12. Friese, Erik; Ladisch, Frieder: Affine symmetries of orbit polytopes (2016)
  13. Gyürki, Štefan: Infinite families of directed strongly regular graphs using equitable partitions (2016)
  14. Hoppe, Travis; Petrone, Anna: Integer sequence discovery from small graphs (2016)
  15. Hüttenhain, Jesko; Ikenmeyer, Christian: Binary determinantal complexity (2016)
  16. Klin, Mikhail; Kriger, Nimrod; Woldar, Andrew: On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters (2016)
  17. Krčadinac, Vedran; Vlahović, Renata: New quasi-symmetric designs by the Kramer-Mesner method (2016)
  18. Larrión, F.; Pizaña, M.A.; Villarroel-Flores, R.: On self-clique shoal graphs (2016)
  19. Larson, C.E.; Van Cleemput, N.: Automated conjecturing. I: Fajtlowicz’s Dalmatian heuristic revisited (2016)
  20. Zhu, Enqiang; Li, Zepeng; Shao, Zehui; Xu, Jin; Liu, Chanjuan: Acyclic 3-coloring of generalized Petersen graphs (2016)

1 2 3 ... 16 17 18 next