Traces
From MaRDI portal
Software:19839
No author found.
Related Items (only showing first 100 items - show all)
On the number of frequency hypercubes \(F^n(4;2,2) \) ⋮ On the dichromatic number of surfaces ⋮ Automorphism groups and normal forms in Normaliz ⋮ Comparing Wiener complexity with eccentric complexity ⋮ Detecting almost symmetries of graphs ⋮ Biregular graphs with three eigenvalues ⋮ Exploiting symmetries in mathematical programming via orbital independence ⋮ Binary determinantal complexity ⋮ Characterization and classification of optimal LCD codes ⋮ Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four ⋮ On digraphs with polygonal restricted numerical range ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ The QAP-polytope and the graph isomorphism problem ⋮ 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 ⋮ Perturbations in a signed graph and its index ⋮ On maximal relative projection constants ⋮ Optimal-depth sorting networks ⋮ A comparison of integer and constraint programming models for the deficiency problem ⋮ Lower bounds for locally highly connected 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 ⋮ On panel-regular \(\tilde{A}_2\) lattices ⋮ Counting arcs in projective planes via Glynn's algorithm ⋮ Enumeration of Seidel matrices ⋮ Enumerating partial Latin rectangles ⋮ A census of small transitive groups and vertex-transitive graphs ⋮ Switching in one-factorisations of complete graphs ⋮ There is no McLaughlin geometry ⋮ 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 ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ 16,051 formulas for Ottaviani's invariant of cubic threefolds ⋮ Counting frequent patterns in large labeled graphs: a hypergraph-based approach ⋮ Variable symmetry breaking in numerical constraint problems ⋮ Affine symmetries of orbit polytopes ⋮ Intersection graph of maximal stars ⋮ Turán numbers for odd wheels ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ Integer sequence discovery from small graphs ⋮ DiscreteZOO: a fingerprint database of discrete objects ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Subjectively interesting connecting trees and forests ⋮ The sextuply shortened binary Golay code is optimal ⋮ On hypercube packings, blocking sets and a covering problem ⋮ Star-critical Ramsey numbers for cycles versus \(K_4\) ⋮ On a family of highly regular graphs by Brouwer, Ivanov, and Klin ⋮ Computing subfields of number fields and applications to Galois group computations ⋮ Biangular lines revisited ⋮ Bipartite biregular Moore graphs ⋮ Enumeration of 2-level polytopes ⋮ Cops and robbers on \(2K_2\)-free graphs ⋮ The cone of quasi-semimetrics and exponent matrices of tiled orders ⋮ A method for enumerating pairwise compatibility graphs with a given number of vertices ⋮ On the \(A_{\alpha}\)-characteristic polynomial of a graph ⋮ Obstructions to convexity in neural codes ⋮ The algebraic matroid of the finite unit norm tight frame (funtf) variety ⋮ Binomial edge ideals of bipartite graphs ⋮ Complex spherical codes with three inner products ⋮ The largest pure partial planes of order 6 have size 25 ⋮ \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions ⋮ Counting Markov equivalence classes for DAG models on trees ⋮ Conflict vs causality in event structures ⋮ Minimal and canonical images ⋮ New refiners for permutation group search ⋮ 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 ⋮ Mappings of Butson-type Hadamard matrices ⋮ There is no (75,32,10,16) strongly regular graph ⋮ 4-cop-win graphs have at least 19 vertices ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ A new partial geometry \(\mathrm{pg}(5,5,2)\) ⋮ Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree ⋮ Permutation group algorithms based on directed graphs ⋮ New quasi-symmetric designs by the Kramer-Mesner method ⋮ Disjoint direct product decompositions of permutation groups ⋮ Generating all finite modular lattices of a given size ⋮ 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 ⋮ The Schläfli Fan ⋮ Kirkman triple systems with subsystems ⋮ A nonexistence certificate for projective planes of order ten with weight 15 codewords ⋮ 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 bivariate permanent polynomials of graphs
This page was built for software: Traces
