The following pages link to nauty (Q13366):
Displaying 50 items.
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays (Q2279982) (← links)
- Constructing unlabelled lattices (Q2282992) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- On the volumes and affine types of trades (Q2290357) (← links)
- Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
- On the upper embedding of symmetric configurations with block size 3 (Q2297727) (← links)
- Refining invariants for computing autotopism groups of partial Latin rectangles (Q2305926) (← links)
- On unbalanced Boolean functions with best correlation immunity (Q2309213) (← links)
- Generalized permanental polynomials of graphs (Q2311039) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Supersaturated designs with the maximum number of factors for a given resolution-rank (Q2320962) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- Calculating the symmetry number of flexible sphere clusters (Q2327829) (← links)
- Optimal packings of two to four equal circles on any flat torus (Q2329183) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Novel techniques to speed up the computation of the automorphism group of a graph (Q2336847) (← links)
- Generalized cages (Q2341070) (← links)
- Normally regular digraphs, association schemes and related combinatorial structures (Q2341741) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- Non-bipartite graphs of fixed order and size that minimize the least eigenvalue (Q2341907) (← links)
- Wheel and star-critical Ramsey numbers for quadrilateral (Q2345616) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- Algorithms for finding generalized minimum aberration designs (Q2349095) (← links)
- Tuza's conjecture for graphs with maximum average degree less than 7 (Q2349964) (← links)
- Distinguishing graphs with zeta functions and generalized spectra (Q2349996) (← links)
- Exhaustive search for snake-in-the-box codes (Q2354613) (← links)
- On the bivariate permanent polynomials of graphs (Q2361557) (← links)
- Isotropic matroids. III: Connectivity (Q2363112) (← links)
- Regularity and planarity of token graphs (Q2364080) (← links)
- The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results (Q2364627) (← links)
- A non-Schurian coherent configuration on 14 points exists (Q2364639) (← links)
- New invariants for the graph isomorphism problem (Q2373963) (← links)
- Eigenvalues of saturated hydrocarbons (Q2375872) (← links)
- Degree distance of unicyclic graphs with given matching number (Q2376081) (← links)
- Dynamic cage survey (Q2378882) (← links)
- New lower bounds for multiple coverings (Q2384059) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking (Q2398438) (← links)
- Minimal extending sets in tournaments (Q2406936) (← links)
- New mixed Moore graphs and directed strongly regular graphs (Q2407033) (← links)
- Almost equitable partitions and new necessary conditions for network controllability (Q2407159) (← links)
- Baby-step giant-step algorithms for the symmetric group (Q2409009) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
- Quantum and non-signalling graph isomorphisms (Q2421559) (← links)
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\) (Q2430707) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
