The following pages link to nauty (Q13366):
Displaying 16 items.
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q1085184) (← links)
- The translation planes of order 49 (Q1344526) (← links)
- The journey of graph kernels through two decades (Q1706611) (← links)
- New refiners for permutation group search (Q1757005) (← links)
- Shedding vertices of vertex decomposable well-covered graphs (Q1800408) (← links)
- Sets of type \((m,n)\) in the affine and projective planes of order nine (Q1904423) (← links)
- Uniqueness of codes using semidefinite programming (Q1999906) (← links)
- Effects of network characteristics on reaching the payoff-dominant equilibrium in coordination games: a simulation study (Q2013311) (← links)
- Subjectively interesting connecting trees and forests (Q2218354) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results (Q2364627) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- 2-tree probe interval graphs have a large obstruction set (Q2565858) (← links)
- Examples of computer experimentation in algebraic combinatorics (Q3085031) (← links)
- Isomorph-Free Exhaustive Generation (Q4386451) (← links)
- Polymake: an approach to modular software design in computational geometry (Q5361580) (← links)
