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

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

1 2 3 ... 24 25 26 next

  1. Akgün, Özgür; Gent, Ian; Kitaev, Sergey; Zantema, Hans: Solving computational problems in the theory of word-representable graphs (2019)
  2. Aleš, Janez: Automorphism groups of Walecki tournaments with zero and odd signatures (2019)
  3. Araya, Makoto; Harada, Masaaki: On the classification of linear complementary dual codes (2019)
  4. Atserias, Albert; Mančinska, Laura; Roberson, David E.; Šámal, Robert; Severini, Simone; Varvitsiotis, Antonios: Quantum and non-signalling graph isomorphisms (2019)
  5. Bachmeier, Georg; Brandt, Felix; Geist, Christian; Harrenstein, Paul; Kardel, Keyvan; Peters, Dominik; Seedig, Hans Georg: (k)-majority digraphs and the hardness of voting with a constant number of voters (2019)
  6. Bohn, Adam; Faenza, Yuri; Fiorini, Samuel; Fisikopoulos, Vissarion; Macchia, Marco; Pashkovich, Kanstantsin: Enumeration of 2-level polytopes (2019)
  7. Brandt, Madeline; Dickinson, William; Ellsworth, AnnaVictoria; Kenkel, Jennifer; Smith, Hanson: Optimal packings of two to four equal circles on any flat torus (2019)
  8. Brouwer, Andries E.; Polak, Sven C.: Uniqueness of codes using semidefinite programming (2019)
  9. Bukovac, Zoe; Farr, Graham; Morgan, Kerri: Short certificates for chromatic equivalence (2019)
  10. Codish, Michael; Miller, Alice; Prosser, Patrick; Stuckey, Peter J.: Constraints for symmetry breaking in graph representation (2019)
  11. Dawar, Anuj; Khan, Kashif: Constructing hard examples for graph isomorphism (2019)
  12. Dehmer, Matthias; Chen, Zengqiang; Shi, Yongtang; Zhang, Yusen; Tripathi, Shailesh; Ghorbani, Modjtaba; Mowshowitz, Abbe; Emmert-Streib, Frank: On efficient network similarity measures (2019)
  13. Dybizbański, Janusz; Nenca, Anna: Oriented chromatic number of Cartesian products and strong products of paths (2019)
  14. Elsenhans, Andreas-Stephan; Klüners, Jürgen: Computing subfields of number fields and applications to Galois group computations (2019)
  15. Geyer, Andrew J.; Bulutoglu, Dursun A.; Ryan, Kenneth J.: Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (2019)
  16. Ghorbani, Ebrahim: Spectral properties of cographs and (P_5)-free graphs (2019)
  17. Goedgebeur, Jan; Máčajová, Edita; Škoviera, Martin: Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (2019)
  18. Goedgebeur, Jan; Ozeki, Kenta; Van Cleemput, Nico; Wiener, Gábor: On the minimum leaf number of cubic graphs (2019)
  19. Jefferson, Christopher; Jonauskyte, Eliza; Pfeiffer, Markus; Waldecker, Rebecca: Minimal and canonical images (2019)
  20. Jefferson, Christopher; Pfeiffer, Markus; Waldecker, Rebecca: New refiners for permutation group search (2019)

1 2 3 ... 24 25 26 next