The following pages link to nauty (Q13366):
Displaying 50 items.
- An effective greedy heuristic for the social golfer problem (Q1761919) (← links)
- One-factorizations of regular graphs of order 12 (Q1773192) (← links)
- The seven classes of \(5\times 6\) triple arrays (Q1779500) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- There is no (75,32,10,16) strongly regular graph (Q1790457) (← links)
- Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (Q1799575) (← links)
- Shedding vertices of vertex decomposable well-covered graphs (Q1800408) (← links)
- The six-dimensional Delaunay polytopes (Q1826970) (← links)
- Small vertex-transitive directed strongly regular graphs (Q1849885) (← links)
- Overlarge sets of 2-(11, 5, 2) designs and related configurations (Q1849899) (← links)
- On halving line arrangements (Q1850013) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- A new lower bound for the football pool problem for six matches (Q1865378) (← links)
- Classifying subspaces of Hamming spaces (Q1866022) (← links)
- A root graph that is locally the line graph of the Petersen graph (Q1869239) (← links)
- Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices (Q1871382) (← links)
- Some Bush-type Hadamard matrices (Q1873080) (← links)
- Enumeration of \(t\)-designs through intersection matrices (Q1877351) (← links)
- Voltage graphs, group presentations and cages (Q1883685) (← links)
- Efficient exhaustive listings of reversible one dimensional cellular automata (Q1884849) (← links)
- Latin squares of order 10 (Q1897685) (← links)
- Two-graphs and skew two-graphs in finite geometries (Q1899431) (← links)
- Sets of type \((m,n)\) in the affine and projective planes of order nine (Q1904423) (← links)
- Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs (Q1906859) (← links)
- The triangular extensions of a generalized quadrangle of order \((3,3)\) (Q1909613) (← links)
- The quaternary complex Hadamard matrices of orders 10, 12, and 14 (Q1928458) (← links)
- Algorithms for highly symmetric linear and integer programs (Q1942261) (← links)
- Uniquely \(K_r\)-saturated graphs (Q1953308) (← links)
- Three color Ramsey numbers for graphs with at most 4 vertices (Q1953359) (← links)
- New computational upper bounds for Ramsey numbers \(R(3,k)\) (Q1953415) (← links)
- On the Shannon capacity of triangular graphs (Q1953512) (← links)
- Cycles through 23 vertices in 3-connected cubic planar graphs (Q1961756) (← links)
- Bipartite biregular Moore graphs (Q1981708) (← links)
- A method for enumerating pairwise compatibility graphs with a given number of vertices (Q1983131) (← links)
- The algebraic matroid of the finite unit norm tight frame (funtf) variety (Q1985773) (← links)
- Complex spherical codes with three inner products (Q1991087) (← links)
- The largest pure partial planes of order 6 have size 25 (Q1991417) (← links)
- Conflict vs causality in event structures (Q1996864) (← links)
- Uniqueness of codes using semidefinite programming (Q1999906) (← links)
- On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← links)
- Multiple zeta values in deformation quantization (Q2006707) (← links)
- Enumeration of finite inverse semigroups (Q2009659) (← links)
- The extended 1-perfect trades in small hypercubes (Q2012553) (← links)
- Effects of network characteristics on reaching the payoff-dominant equilibrium in coordination games: a simulation study (Q2013311) (← links)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- On Mostar and edge Mostar indices of graphs (Q2035723) (← links)
- A new partial geometry \(\mathrm{pg}(5,5,2)\) (Q2040503) (← links)
- Permutation group algorithms based on directed graphs (Q2042953) (← links)
- Disjoint direct product decompositions of permutation groups (Q2048148) (← links)
