Cited in
(only showing first 100 items - show all)- Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\)
- On the number of frequency hypercubes F^n(4;2,2)
- Subjectively interesting connecting trees and forests
- On the enumeration of minimal non-pairwise compatibility graphs
- The minimality of the Georges-Kelmans graph
- Cops and robbers on \(2K_2\)-free graphs
- A method for enumerating pairwise compatibility graphs with a given number of vertices
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- Classical symmetries and the quantum approximate optimization algorithm
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- The sextuply shortened binary Golay code is optimal
- DiscreteZOO: a fingerprint database of discrete objects
- Permutation group algorithms based on directed graphs
- A Note on Universal Point Sets for Planar Graphs
- Comparing Wiener complexity with eccentric complexity
- Exploiting symmetries in mathematical programming via orbital independence
- Characterization and classification of optimal LCD codes
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
- Iterative equitable partition of graph as a model of constant structure discrete time closed semantic system
- Calculating the symmetry number of flexible sphere clusters
- Complex spherical codes with three inner products
- The largest pure partial planes of order 6 have size 25
- The 4-way intersection problem for kite systems
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Minimal extending sets in tournaments
- Relating centralities in graphs and the principal eigenvector of its distance matrix
- On the minimum leaf number of cubic graphs
- On a family of highly regular graphs by Brouwer, Ivanov, and Klin
- Novel techniques to speed up the computation of the automorphism group of a graph
- Distinguishing graphs with zeta functions and generalized spectra
- Generalizing cographs to 2-cographs
- Computation of new diagonal graph Ramsey numbers
- The optimal packing of eight points in the real projective plane
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- A proof system for graph (non)-isomorphism verification
- Short certificates for chromatic equivalence
- Conflict vs causality in event structures
- On decomposability of simple cyclic triple systems
- Tight lower and upper bounds for the complexity of canonical colour refinement
- The QAP-polytope and the graph isomorphism problem
- Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
- Trinajstić index
- Error thresholds for arbitrary Pauli noise
- The chromatic number of the square of the 8-cube
- On the (signless) Laplacian permanental polynomials of graphs
- Multiple zeta values in deformation quantization
- The extended 1-perfect trades in small hypercubes
- The Schläfli Fan
- Star-critical Ramsey numbers for cycles versus \(K_4\)
- Biangular lines revisited
- Quantum and non-signalling graph isomorphisms
- On the volumes and affine types of trades
- Biregular graphs with three eigenvalues
- Binary determinantal complexity
- Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
- Construction of all minimal edge extensions of the graph with isomorphism rejection
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Bipartite biregular Moore graphs
- Maximum modulus of independence roots of graphs and trees
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- Automorphism groups and normal forms in Normaliz
- The cone of quasi-semimetrics and exponent matrices of tiled orders
- Improved static symmetry breaking for SAT
- Constructing unlabelled lattices
- Order nine MMIK graphs
- Oriented chromatic number of Cartesian products and strong products of paths
- Counting Markov equivalence classes for DAG models on trees
- Orbital independence in symmetric mathematical programs
- Mappings of Butson-type Hadamard matrices
- Small \(f\)-vectors of 3-spheres and of 4-polytopes
- On Ryser's conjecture for linear intersecting multipartite hypergraphs
- Integer programming for classifying orthogonal arrays
- The algebraic matroid of the finite unit norm tight frame (funtf) variety
- Constraints for symmetry breaking in graph representation
- Conics in sextic \(K3\)-surfaces in \(\mathbb{P}^4\)
- Exhaustive search for snake-in-the-box codes
- Isomorphism and invariants of parallelisms of projective spaces
- Computing maximum unavoidable subgraphs using SAT solvers
- Study of graph isomorphism using Jordan forms of adjacency matrices
- Refining invariants for computing autotopism groups of partial Latin rectangles
- The SU(3) spin model with chemical potential by series expansion techniques
- Switching in one-factorisations of complete graphs
- On digraphs with polygonal restricted numerical range
- On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\)
- On stepwise transmission irregular graphs
- New refiners for permutation group search
- Graphs with few Hamiltonian cycles
- Enumeration of finite inverse semigroups
- Edge crossings in random linear arrangements
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- On the minimum weights of binary linear complementary dual codes
- Enumerating partial Latin rectangles
- scientific article; zbMATH DE number 7008235 (Why is no real title available?)
- Hadamard diagonalizable graphs of order at most 36
- Cartesian lattice counting by the vertical 2-sum
- Cohen-Macaulay binomial edge ideals and accessible graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- Algorithms for finding generalized minimum aberration designs
- New quasi-symmetric designs by the Kramer-Mesner method
- Constructions of cospectral graphs with different zero forcing numbers
This page was built for software: Traces
