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

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

1 2 3 ... 27 28 29 next

  1. DeBiasio, Louis; Lo, Allan; Molla, Theodore; Treglown, Andrew: Transitive tournament tilings in oriented graphs with large minimum total degree (2021)
  2. Dubinsky, Manuel; Massri, César; Taubin, Gabriel: Minimum spanning tree cycle intersection problem (2021)
  3. Gorla, Daniele; Salvo, Ivano: Conflict vs causality in event structures (2021)
  4. Gunnells, Paul E.: Generalized Catalan numbers from hypergraphs (2021)
  5. Jayawardene, Chula J.; Narváez, David; Radziszowski, Stanisław: Star-critical Ramsey numbers for cycles versus (K_4) (2021)
  6. Xu, Kexiang; Ilić, Aleksandar; Iršič, Vesna; Klavžar, Sandi; Li, Huimin: Comparing Wiener complexity with eccentric complexity (2021)
  7. Abrosimov, Mikhaĭl Borisovich; Sudani, Hayder Hussein Karim; Lobov, Aleksandr Andreevich: Construction of all minimal edge extensions of the graph with isomorphism rejection (2020)
  8. Adams, Peter; El-Zanati, Saad I.; Florido, Peter; Turner, William: On 2- and 3-factorizations of complete 3-uniform hypergraphs of order up to 9 (2020)
  9. Alemany-Puig, Lluís; Ferrer-I-Cancho, Ramon: Edge crossings in random linear arrangements (2020)
  10. Araya, Makoto; Harada, Masaaki: On the minimum weights of binary linear complementary dual codes (2020)
  11. Arvind, V.; Fuhlbrück, Frank; Köbler, Johannes; Verbitsky, Oleg: On Weisfeiler-Leman invariance: subgraph counts and related graph properties (2020)
  12. Banks, Peter; Panzer, Erik; Pym, Brent: Multiple zeta values in deformation quantization (2020)
  13. Berčič, Katja; Vidali, Janoš: DiscreteZOO: a fingerprint database of discrete objects (2020)
  14. Bernstein, Daniel Irving; Farnsworth, Cameron; Rodriguez, Jose Israel: The algebraic matroid of the finite unit norm tight frame (funtf) variety (2020)
  15. Bian, Zhengbing; Chudak, Fabian; Macready, William; Roy, Aidan; Sebastiani, Roberto; Varotti, Stefano: Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (2020)
  16. Bikov, Aleksandar; Nenov, Nedyalko: On the independence number of ((3,3))-Ramsey graphs and the Folkman number (F_e(3,3;4)) (2020)
  17. Bright, Curtis; Cheung, Kevin; Stevens, Brett; Roy, Dominique; Kotsireas, Ilias; Ganesh, Vijay: A nonexistence certificate for projective planes of order ten with weight 15 codewords (2020)
  18. Brown, Jason I.; Cameron, Ben: Maximum modulus of independence roots of graphs and trees (2020)
  19. Chudnovsky, Maria; Goedgebeur, Jan; Schaudt, Oliver; Zhong, Mingxian: Obstructions for three-coloring graphs without induced paths on six vertices (2020)
  20. Danan, Eiran; Falcón, Raúl M.; Kotlar, Dani; Marbach, Trent G.; Stones, Rebecca J.: Refining invariants for computing autotopism groups of partial Latin rectangles (2020)

1 2 3 ... 27 28 29 next