The following pages link to nauty (Q13366):
Displaying 50 items.
- New difference sets in nonabelian groups of order 100 (Q2781047) (← links)
- Kirkman triple systems of order 21 with nontrivial automorphism group (Q2781233) (← links)
- Local mirror symmetry at higher genus. (Q2782338) (← links)
- Enumeration of MOLS of small order (Q2792342) (← links)
- Improved Static Symmetry Breaking for SAT (Q2818005) (← links)
- Computing Maximum Unavoidable Subgraphs Using SAT Solvers (Q2818013) (← links)
- Quantum state-independent contextuality requires 13 rays (Q2826706) (← links)
- Finding symmetry in models of concurrent systems by static channel diagram analysis (Q2848420) (← links)
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement (Q2849306) (← links)
- \textsc{Spin-to-Grape}: a tool for analysing symmetry in Promela models (Q2851072) (← links)
- On extremal \(k\)-CNF formulas (Q2857316) (← links)
- Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
- On zero divisors with small support in group rings of torsion-free groups. (Q2873307) (← links)
- Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation (Q2879322) (← links)
- Hash kernels for structured data (Q2880988) (← links)
- Conflict Anticipation in the Search for Graph Automorphisms (Q2891455) (← links)
- Graph kernels (Q2896075) (← links)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- The first player wins the one-colour triangle avoidance game on 16 vertices (Q2906377) (← links)
- Cycle structure of autotopisms of quasigroups and Latin squares (Q2909597) (← links)
- Most switching classes with primitive automorphism groups contain graphs with trivial groups (Q2947384) (← links)
- Nested colourings of graphs (Q2947386) (← links)
- Quartic integral Cayley graphs (Q2950080) (← links)
- Conflict Propagation and Component Recursion for Canonical Labeling (Q2999342) (← links)
- (Q2999650) (← links)
- (Q2999988) (← links)
- (Q3024011) (← links)
- (Q3024021) (← links)
- (Q3024729) (← links)
- Complexity and algorithms for computing Voronoi cells of lattices (Q3055167) (← links)
- Ranking measures for radially Moore graphs (Q3064042) (← links)
- The minimum rank problem over finite fields (Q3075175) (← links)
- Examples of computer experimentation in algebraic combinatorics (Q3085031) (← links)
- The Kramer-Mesner method with tactical decompositions: some new unitals on 65 points (Q3087611) (← links)
- (Q3089193) (← links)
- (Q3105959) (← links)
- Solving computational problems in the theory of word-representable graphs (Q3120420) (← links)
- (Q3120651) (← links)
- (Q3138966) (← links)
- Three Ideas for the Quadratic Assignment Problem (Q3144407) (← links)
- (Q3155157) (← links)
- The number of Latin squares of order 11 (Q3168748) (← links)
- Finding the Exact Integrality Gap for Small Traveling Salesman Problems (Q3169005) (← links)
- Polymake and Lattice Polytopes (Q3176592) (← links)
- Small $f$-vectors of 3-spheres and of 4-polytopes (Q3177727) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Enumerating Neighborly Polytopes and Oriented Matroids (Q3194584) (← links)
- A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices (Q3225724) (← links)
- The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures (Q3296726) (← links)
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ (Q3300687) (← links)
