nauty

swMATH611MaRDI QIDQ13366FDOQ13366

Author name not available (Why is that?)

Described by source

• nauty in Macaulay2

Cited In (only showing first 100 items - show all)

• Special cycles in independence complexes and superfrustration in some lattices
• Enumerating cube tilings
• There is no \([21,5,14]\) code over \(\mathbb F_5\)
• A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
• McKay's canonical graph labeling algorithm
• Computing the autotopy group of a Latin square by cycle structure
• On the Ramsey number \(R(4,6)\)
• Title not available (Why is that?)
• New difference sets in nonabelian groups of order 100
• The cycle switching graph of the Steiner triple systems of order 19 is connected
• Normal edge-transitive Cayley graphs of Frobenius groups
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• Distinguishing graphs with zeta functions and generalized spectra
• Short certificates for chromatic equivalence
• Geometric realisation of the graphs of McKay-Miller-Širáň
• Set-homogeneous directed graphs
• Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
• Eigenvalues of saturated hydrocarbons
• Orderly algorithm to enumerate central groupoids and their graphs
• The number of Latin squares of order 11
• Graph based isomorph-free generation of two-level regular fractional factorial designs
• Chromatic-index-critical graphs of orders 13 and 14
• Roots of Ehrhart polynomials arising from graphs
• Combinatorial cube packings in the cube and the torus
• Fastest mixing Markov chain on graphs with symmetries
• Generalized cages
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• A Census of Small Latin Hypercubes
• Dynamic cage survey
• Algorithms for highly symmetric linear and integer programs
• Computing the Folkman number \(F_v(2,2,3;4)\)
• On the minimum number of blocks defining a design
• Algorithms for Greechie diagrams
• Edge-graph diameter bounds for convex polytopes with few facets
• Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases
• The Steiner quadruple systems of order 16
• The distance-regular graphs of valency four
• Partitions of sets of designs on seven, eight and nine points
• Efficient exhaustive listings of reversible one dimensional cellular automata
• Pruning by isomorphism in branch-and-cut
• Exploiting orbits in symmetric ILP
• Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
• Small weight codewords in the codes arising from Desarguesian projective planes
• 2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes
• Classifying simplicial dissections of convex polyhedra with symmetry
• Clique algorithms for finding substructures in generalized quadrangles
• About the code equivalence
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• Finding the exact integrality gap for small traveling salesman problems
• Isomorph-Free Exhaustive Generation
• Three Ideas for the Quadratic Assignment Problem
• Algebraic polytopes in Normaliz
• Counting Hamiltonian cycles in bipartite graphs
• Graph reconstruction numbers
• Extremal graphs with a given number of perfect matchings
• Minor‐order obstructions for the graphs of vertex cover 6
• Title not available (Why is that?)
• Effects of network characteristics on reaching the payoff-dominant equilibrium in coordination games: a simulation study
• 4-cop-win graphs have at least 19 vertices
• Title not available (Why is that?)
• Ramsey theory applications
• Finding symmetry in models of concurrent systems by static channel diagram analysis
• On maximal relative projection constants
• Searching for maximal partial ovoids and spreads in generalized quadrangles
• Classification of Graeco-Latin Cubes
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Optimal-depth sorting networks
• A comparison of integer and constraint programming models for the deficiency problem
• Lower bounds for locally highly connected graphs
• Title not available (Why is that?)
• Complexity and algorithms for computing Voronoi cells of lattices
• On the degree distance of unicyclic graphs with given matching number
• Classification of triangle-free \(22_3\) configurations
• On the extremal properties of the average eccentricity
• Symmetry in integer linear programming
• Ranking measures for radially Moore graphs
• Families of pairs of graphs with a large number of common cards
• Non-Cayley vertex-transitive graphs of order twice the product of two odd primes
• 3- and 4-critical graphs of small even order
• Complete mining of frequent patterns from graphs: Mining graph data
• On distance-balanced graphs
• Title not available (Why is that?)
• Medial layer graphs of equivelar 4-polytopes
• Title not available (Why is that?)
• DiscreteZOO: a fingerprint database of discrete objects
• Title not available (Why is that?)
• Permutation group algorithms based on directed graphs
• On self-clique shoal graphs
• Practical graph isomorphism. II.
• Minimal strong digraphs
• Title not available (Why is that?)
• Uniqueness of graph square roots of girth six
• \textsc{Spin-to-Grape}: a tool for analysing symmetry in Promela models
• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• Cospectral graphs and the generalized adjacency matrix
• Title not available (Why is that?)
• The Schläfli Fan
• Classification algorithms for codes and designs
• Examples of Kähler-Einstein toric Fano manifolds associated to non-symmetric reflexive polytopes
• Strategic balance in graphs

This page was built for software: nauty