The following pages link to nauty (Q13366):
Displaying 50 items.
- Linear programming in some Ramsey problems (Q1328393) (← links)
- Classification of hyperovals in \(PG(2,32)\) (Q1331281) (← links)
- A microcomputer based system for small relation algebras (Q1342135) (← links)
- Yet another distance regular graph related to a Golay code (Q1344396) (← links)
- The translation planes of order 49 (Q1344526) (← links)
- New (100, 45, 20) symmetric designs and Bush-type Hadamard matrices of order 100 (Q1348129) (← links)
- Enumeration of semi-Latin squares (Q1356446) (← links)
- Aspects of complete sets of \(9\times 9\) pairwise orthogonal latin squares (Q1356490) (← links)
- Some \(6\times 11\) Youden squares and double Youden rectangles (Q1356492) (← links)
- 3- and 4-critical graphs of small even order (Q1357738) (← links)
- Partitions of sets of designs on seven, eight and nine points (Q1361668) (← links)
- Determinants of matrices of the conference type (Q1362671) (← links)
- Overlarge sets and partial geometries (Q1375942) (← links)
- Graph products and monochromatic multiplicities (Q1382400) (← links)
- Complete mining of frequent patterns from graphs: Mining graph data (Q1395734) (← links)
- Pruning by isomorphism in branch-and-cut (Q1396814) (← links)
- Classification of whist tournaments with up to 12 players (Q1406035) (← links)
- Some Menon designs having U(3, 3) as an automorphism group (Q1409600) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Exploiting orbits in symmetric ILP (Q1424276) (← links)
- Geometric realisation of the graphs of McKay-Miller-Širáň (Q1426098) (← links)
- Orthogonal double covers of \(K_{n,n}\) by small graphs. (Q1428552) (← links)
- An orderly algorithm and some applications in finite geometry (Q1584240) (← links)
- Totally magic graphs (Q1613532) (← links)
- On the classification of linear complementary dual codes (Q1618248) (← links)
- Detecting almost symmetries of graphs (Q1621684) (← links)
- Oriented chromatic number of Cartesian products and strong products of paths (Q1630938) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Augmenting the algebraic connectivity for certain families of graphs (Q1634763) (← links)
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees (Q1636844) (← links)
- Small clique number graphs with three trivial critical ideals (Q1642901) (← links)
- Perturbations in a signed graph and its index (Q1649918) (← links)
- On panel-regular \(\tilde{A}_2\) lattices (Q1681812) (← links)
- Counting arcs in projective planes via Glynn's algorithm (Q1685543) (← links)
- Enumeration of Seidel matrices (Q1686262) (← links)
- There is no McLaughlin geometry (Q1689033) (← links)
- The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) (← links)
- Turán numbers for odd wheels (Q1699569) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index (Q1720330) (← links)
- The sextuply shortened binary Golay code is optimal (Q1727350) (← links)
- On a family of highly regular graphs by Brouwer, Ivanov, and Klin (Q1732770) (← links)
- Computing subfields of number fields and applications to Galois group computations (Q1733297) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- On the \(A_{\alpha}\)-characteristic polynomial of a graph (Q1743145) (← links)
- Binomial edge ideals of bipartite graphs (Q1746565) (← links)
- Counting Markov equivalence classes for DAG models on trees (Q1752602) (← links)
- Minimal and canonical images (Q1755579) (← links)
- New refiners for permutation group search (Q1757005) (← links)
