The following pages link to nauty (Q13366):
Displaying 50 items.
- On triangular matroids induced by \(n_3\)-configurations (Q2053539) (← 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)
- Smooth cubic surfaces with 15 lines (Q2100116) (← 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)
- On interval transmission irregular graphs (Q2143787) (← links)
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs (Q2152271) (← links)
- On new record graphs close to bipartite Moore graphs (Q2152609) (← links)
- Strongly regular configurations (Q2161426) (← 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)
- 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)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- A model for finding transition-minors (Q2192081) (← links)
- Packing, partitioning, and covering symresacks (Q2192122) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Intersection graph of maximal stars (Q2197473) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- DiscreteZOO: a fingerprint database of discrete objects (Q2209260) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Subjectively interesting connecting trees and forests (Q2218354) (← links)
- Star-critical Ramsey numbers for cycles versus \(K_4\) (Q2227100) (← links)
- Biangular lines revisited (Q2230922) (← links)
- Group theory on quantum Boltzmann machine (Q2233057) (← links)
- Cops and robbers on \(2K_2\)-free graphs (Q2237234) (← links)
- The cone of quasi-semimetrics and exponent matrices of tiled orders (Q2237237) (← links)
- On the resistance diameters of graphs and their line graphs (Q2243147) (← links)
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\) (Q2245762) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- On stepwise transmission irregular graphs (Q2246445) (← links)
- Subadditivity of syzygies of Koszul algebras (Q2255287) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- Inheritance of oscillation in chemical reaction networks (Q2279240) (← links)
