nauty
From MaRDI portal
Software:13366
swMATH611MaRDI QIDQ13366FDOQ13366
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- There exists no Steiner system \(S(4,5,17)\)
- The first player wins the one-colour triangle avoidance game on 16 vertices
- New lower bounds for multiple coverings
- A Note on Universal Point Sets for Planar Graphs
- Title not available (Why is that?)
- Comparing Wiener complexity with eccentric complexity
- Exploiting symmetries in mathematical programming via orbital independence
- Characterization and classification of optimal LCD codes
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
- Linear optimization over permutation groups
- A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
- Title not available (Why is that?)
- A proof system for graph (non)-isomorphism verification
- Automatic proof of graph nonisomorphism
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Computers and discovery in algebraic graph theory
- Title not available (Why is that?)
- On the classification of linear complementary dual codes
- Designs on the web
- Latin squares of order 10
- A computational comparison of symmetry handling methods for mixed integer programs
- Orthomorphisms and the construction of projective planes
- Orbital shrinking: theory and applications
- Automated reformulation of specifications by safe delay of constraints
- On the existence of difference sets in groups of order 96
- Predicting and detecting symmetries in FOL finite model search
- The algebraic matroid of the finite unit norm tight frame (funtf) variety
- On the minimum weights of binary linear complementary dual codes
- Obstructions for three-coloring graphs without induced paths on six vertices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for finding generalized minimum aberration designs
- New results on codes with covering radius 1 and minimum distance \(2\)
- Steiner triple systems of order 19 with nontrivial automorphism group
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- A root graph that is locally the line graph of the Petersen graph
- A complete \(L (2, 1)\) span characterization for small trees
- An infinite family of excluded minors for strong base-orderability
- 16,051 formulas for Ottaviani's invariant of cubic threefolds
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Plurigraph coloring and scheduling problems
- Affine symmetries of orbit polytopes
- Variable symmetry breaking in numerical constraint problems
- Matching-star Ramsey minimal graphs
- On highly regular strongly regular graphs
- Orbital Independence in Symmetric Mathematical Programs
- Classification of three-class association schemes using backtracking with dynamic variable ordering
- On balanced incomplete-block designs with repeated blocks
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Orthogonal double covers of \(K_{n,n}\) by small graphs.
- Integer sequence discovery from small graphs
- The Primitive Distance-Transitive Representations of the Fischer Groups
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- Minimal and canonical images
- Isomorphism and Invariants of Parallelisms of Projective Spaces
- Integer Programming for Classifying Orthogonal Arrays
- Breaking instance-independent symmetries in exact graph coloring
- On some interconnections between combinatorial optimization and extremal graph theory
- On the number of frequency hypercubes \(F^n(4;2,2) \)
- Symmetry definitions for constraint satisfaction problems
- Overlarge sets and partial geometries
- On some symmetric designs with classical parameters
- General embedding problems and two-distance sets in Minkowski planes
- Minimal extending sets in tournaments
- Fully gated graphs: Recognition and convex operations
- Voltage graphs, group presentations and cages
- A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\)
- The minimum rank problem over finite fields
- Kirkman triple systems of order 21 with nontrivial automorphism group
- Nonhamiltonian 3-Connected Cubic Planar Graphs
- One-factorizations of regular graphs of order 12
- Symmetries of partial Latin squares
- 2-tree probe interval graphs have a large obstruction set
- Frequency squares of orders 7 and 8
- A small trivalent graph of girth 14
- Schur rings and non-symmetric association schemes on 64 vertices
- On the enumeration of some D-optimal designs
- Partitioning sets of quadruples into designs. III
- Partitioning sets of quadruples into designs. I
- The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles
- Mappings of Butson-type Hadamard matrices
- Edge local complementation and equivalence of binary linear codes
- On Ryser's conjecture for linear intersecting multipartite hypergraphs
- Modular forms in quantum field theory
- The complexity of chromatic strength and chromatic edge strength
- On the coexistence of conference matrices and near resolvable \(2\)-\((2k+1,k,k-1)\) designs.
- On zero divisors with small support in group rings of torsion-free groups.
- Title not available (Why is that?)
- Enumerating partial Latin rectangles
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
- Algorithmic approach to non-symmetric 3-class association schemes
- Infinite families of directed strongly regular graphs using equitable partitions
- New quasi-symmetric designs by the Kramer-Mesner method
- Improved Static Symmetry Breaking for SAT
- Classifying subspaces of Hamming spaces
- Generating all finite modular lattices of a given size
- Computing automorphisms of semigroups.
- Some properties of graphs determined by edge zeta functions
This page was built for software: nauty