Traces
From MaRDI portal
Cited in
(only showing first 100 items - show all)- GAP
- StandardFF
- nauty
- CDCLSym
- Vole
- SageMath
- SymChaff
- TopSpin
- The Schläfli Fan
- Detecting almost symmetries of graphs
- Oriented chromatic number of Cartesian products and strong products of paths
- The QAP-polytope and the graph isomorphism problem
- Perturbations in a signed graph and its index
- Renew
- On panel-regular \(\tilde{A}_2\) lattices
- Counting arcs in projective planes via Glynn's algorithm
- Enumeration of Seidel matrices
- There is no McLaughlin geometry
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- Turán numbers for odd wheels
- Stony Brook
- Cliquer
- The sextuply shortened binary Golay code is optimal
- On a family of highly regular graphs by Brouwer, Ivanov, and Klin
- Computing subfields of number fields and applications to Galois group computations
- On the \(A_{\alpha}\)-characteristic polynomial of a graph
- Binomial edge ideals of bipartite graphs
- Counting Markov equivalence classes for DAG models on trees
- Minimal and canonical images
- New refiners for permutation group search
- There is no (75,32,10,16) strongly regular graph
- Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
- DISCRETA
- House of Graphs
- Flagmatic
- OEIS
- GRAPE
- TACO
- DESIGN
- Smallsemi
- GUAVA
- posets
- Bipartite biregular Moore graphs
- A method for enumerating pairwise compatibility graphs with a given number of vertices
- The algebraic matroid of the finite unit norm tight frame (funtf) variety
- Complex spherical codes with three inner products
- The largest pure partial planes of order 6 have size 25
- Conflict vs causality in event structures
- Uniqueness of codes using semidefinite programming
- On the (signless) Laplacian permanental polynomials of graphs
- Multiple zeta values in deformation quantization
- Enumeration of finite inverse semigroups
- The extended 1-perfect trades in small hypercubes
- MI-GRAAL
- 4-cop-win graphs have at least 19 vertices
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- Permutation group algorithms based on directed graphs
- Disjoint direct product decompositions of permutation groups
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- On highly regular strongly regular graphs
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph
- The smallest pair of cospectral cubic graphs with different chromatic indexes
- Bertini.m2
- Tritangents to smooth sextic curves
- Vertex removal in biclique graphs
- Classical symmetries and the quantum approximate optimization algorithm
- House of graphs 2.0: a database of interesting graphs and more
- Generalizing cographs to 2-cographs
- On the dichromatic number of surfaces
- Automorphism groups and normal forms in Normaliz
- On digraphs with polygonal restricted numerical range
- Hadamard diagonalizable graphs of order at most 36
- Cartesian lattice counting by the vertical 2-sum
- Cohen-Macaulay binomial edge ideals and accessible graphs
- Collapsibility and homological properties of \(\mathfrak{I}\)-contractible transformations
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Strongly regular configurations
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms
- Maximum modulus of independence roots of graphs and trees
- On the minimum weights of binary linear complementary dual codes
- Enumerating partial Latin rectangles
- A census of small transitive groups and vertex-transitive graphs
- Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\)
- On tail dependence matrices. The realization problem for parametric families
- A model for finding transition-minors
- Packing, partitioning, and covering symresacks
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach
- Intersection graph of maximal stars
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach
- DiscreteZOO: a fingerprint database of discrete objects
- MINION
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Subjectively interesting connecting trees and forests
- Star-critical Ramsey numbers for cycles versus \(K_4\)
- Biangular lines revisited
- Cops and robbers on \(2K_2\)-free graphs
- The cone of quasi-semimetrics and exponent matrices of tiled orders
- On the resistance diameters of graphs and their line graphs
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
This page was built for software: Traces
