The following pages link to nauty (Q13366):
Displaying 50 items.
- A complete \(L (2, 1)\) span characterization for small trees (Q896092) (← links)
- An infinite family of excluded minors for strong base-orderability (Q896863) (← links)
- On the degree distance of unicyclic graphs with given matching number (Q897281) (← links)
- 16,051 formulas for Ottaviani's invariant of cubic threefolds (Q897786) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Variable symmetry breaking in numerical constraint problems (Q900305) (← links)
- Affine symmetries of orbit polytopes (Q900854) (← links)
- A computational approach to construct a multivariate complete graph invariant (Q903598) (← links)
- Matching-star Ramsey minimal graphs (Q904534) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- Constructing the vertex-transitive graphs of order 24 (Q908938) (← links)
- Steiner triple systems of order 19 and 21 with subsystems of order 7 (Q924955) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- General embedding problems and two-distance sets in Minkowski planes (Q945968) (← links)
- There exists no Steiner system \(S(4,5,17)\) (Q958759) (← links)
- On distance-balanced graphs (Q966128) (← links)
- Combinatorial cube packings in the cube and the torus (Q966162) (← links)
- Line-transitive point-imprimitive linear spaces: the grid case (Q993649) (← links)
- The minimum rank problem over the finite field of order 2: Minimum rank 3 (Q999773) (← links)
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) (Q1003590) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- Small weight codewords in the codes arising from Desarguesian projective planes (Q1008962) (← links)
- Edge local complementation and equivalence of binary linear codes (Q1009082) (← links)
- 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 (Q1009136) (← links)
- Statistical designs for two-color microarray experiments involving technical replication (Q1010555) (← links)
- Classification of the (0, 2)-graphs of valency 8 (Q1011491) (← links)
- Linear optimization over permutation groups (Q1019295) (← links)
- Higmanian rank-5 association schemes on 40 points (Q1024880) (← links)
- Flag-transitive symmetric 2-(96,20,4)-designs (Q1024987) (← links)
- Graph based isomorph-free generation of two-level regular fractional factorial designs (Q1036716) (← links)
- Automatic symmetry detection for Promela (Q1040774) (← links)
- Topological configurations \((n_4)\) exist for all \(n\geq 17\) (Q1041596) (← links)
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q1085184) (← links)
- Partitioning sets of quadruples into designs. III (Q1182955) (← links)
- The 2-rotational Steiner triple systems of order 25 (Q1183971) (← links)
- The binary self-dual codes of length up to 32: A revised enumeration (Q1193570) (← links)
- The block-transitive, point-imprimitive 2-(729,8,1) designs (Q1197100) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Partitioning sets of quadruples into designs. I (Q1263589) (← links)
- Nearly linear time algorithms for permutation groups: An interplay between theory and practice (Q1270640) (← links)
- Some tapas of computer algebra (Q1271120) (← links)
- A note on large graphs of diameter two and given maximum degree (Q1272472) (← links)
- A new distance-regular graph associated to the Mathieu group \(M_{10}\) (Q1272896) (← links)
- Orbifold triangulations and crystallographic groups (Q1280241) (← links)
- Perfect Graeco-Latin balanced incomplete block designs (pergolas) (Q1292873) (← links)
- The distance-regular graphs of valency four (Q1296385) (← links)
- The computation of chromatic polynomials (Q1297452) (← links)
- On the structure and classification of SOMAs: Generalizations of mutually orthogonal Latin squares (Q1305167) (← links)
- Non-Cayley vertex-transitive graphs of order twice the product of two odd primes (Q1312995) (← links)
- Enumerating \(4\times 5\) and \(5\times 6\) double Youden rectangles (Q1322264) (← links)
