The following pages link to Practical graph isomorphism. II. (Q2437295):
Displaying 50 items.
- New refiners for permutation group search (Q1757005) (← 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)
- 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)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← 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)
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\) (Q2057608) (← links)
- On highly regular strongly regular graphs (Q2065709) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- The smallest pair of cospectral cubic graphs with different chromatic indexes (Q2065795) (← links)
- Tritangents to smooth sextic curves (Q2087366) (← links)
- Vertex removal in biclique graphs (Q2091812) (← links)
- Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
- House of graphs 2.0: a database of interesting graphs and more (Q2104929) (← links)
- Generalizing cographs to 2-cographs (Q2111769) (← links)
- Discrete and metric divisorial gonality can be different (Q2120835) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- Automorphism groups and normal forms in Normaliz (Q2125270) (← links)
- On digraphs with polygonal restricted numerical range (Q2133686) (← links)
- Hadamard diagonalizable graphs of order at most 36 (Q2138573) (← links)
- Cartesian lattice counting by the vertical 2-sum (Q2141002) (← links)
- Cohen-Macaulay binomial edge ideals and accessible graphs (Q2141082) (← links)
- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations (Q2141754) (← links)
- Spectral characterizations of tournaments (Q2142659) (← links)
- Multi-objective optimization model and evolutional solution of network node matching problem (Q2147883) (← links)
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs (Q2152271) (← links)
- Non-embeddable quasi-residual quasi-symmetric designs (Q2154496) (← links)
- On the classification of quaternary optimal Hermitian LCD codes (Q2154884) (← links)
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs (Q2158206) (← links)
- Strongly regular configurations (Q2161426) (← links)
- The 4-GDDs of type \(3^56^2\) (Q2166268) (← links)
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- Maximum modulus of independence roots of graphs and trees (Q2175814) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- On the minimum weights of binary linear complementary dual codes (Q2179521) (← links)
- Enumerating partial Latin rectangles (Q2188838) (← links)
- A census of small transitive groups and vertex-transitive graphs (Q2188974) (← links)
- Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\) (Q2190981) (← links)
