Traces - MaRDI portal

swMATH7823MaRDI QIDQ19839FDOQ19839

Author name not available (Why is that?)

Described by source

Practical graph isomorphism. II.

Cited In (only showing first 100 items - show all)

Subjectively interesting connecting trees and forests
A method for enumerating pairwise compatibility graphs with a given number of vertices
A new partial geometry $\mathrm{pg}(5,5,2)$
The sextuply shortened binary Golay code is optimal
Complex spherical codes with three inner products
The largest pure partial planes of order 6 have size 25
$k$-majority digraphs and the hardness of voting with a constant number of voters
Computation of new diagonal graph Ramsey numbers
On a family of highly regular graphs by Brouwer, Ivanov, and Klin
Conflict vs causality in event structures
Tight lower and upper bounds for the complexity of canonical colour refinement
The QAP-polytope and the graph isomorphism problem
On the (signless) Laplacian permanental polynomials of graphs
Multiple zeta values in deformation quantization
The extended 1-perfect trades in small hypercubes
Quantum and non-signalling graph isomorphisms
On Weisfeiler-Leman invariance: subgraph counts and related graph properties
On the volumes and affine types of trades
Maximum modulus of independence roots of graphs and trees
Bipartite biregular Moore graphs
The resistance perturbation distance: a metric for the analysis of dynamic networks
Constructing unlabelled lattices
Oriented chromatic number of Cartesian products and strong products of paths
Counting Markov equivalence classes for DAG models on trees
Constraints for symmetry breaking in graph representation
New refiners for permutation group search
Enumeration of finite inverse semigroups
The uniqueness of a distance-regular graph with intersection array $\{32,27,8,1;1,4,27,32\}$ and related results
Computing subfields of number fields and applications to Galois group computations
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
There is no (75,32,10,16) strongly regular graph
The minimum number of minimal codewords in an $[n, k]$-code and in graphic codes
Disjoint direct product decompositions of permutation groups
Inheritance of oscillation in chemical reaction networks
On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
Almost equitable partitions and new necessary conditions for network controllability
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
New bounds for Ramsey numbers $R ( K_k - e , K_l - e )$
Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
On the seven non-isomorphic solutions of the fifteen schoolgirl problem
Counting arcs in projective planes via Glynn's algorithm
Generalized permanental polynomials of graphs
On the bivariate permanent polynomials of graphs
A census of small transitive groups and vertex-transitive 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
Equimatchable regular graphs
Enumeration of Seidel matrices
There is no McLaughlin geometry
Regularity and planarity of token graphs
Perturbations in a signed graph and its index
On the dichromatic number of surfaces
Turán numbers for odd wheels
Structural and computational results on platypus graphs
Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
Quantum state-independent contextuality requires 13 rays
On the $A_{\alpha}$-characteristic polynomial of a graph
Tritangents to smooth sextic curves
Vertex removal in biclique graphs
Collapsibility and homological properties of $\mathfrak{I}$-contractible transformations
On the number of frequency hypercubes $F^n(4;2,2) $
A Note on Universal Point Sets for Planar Graphs
DiscreteZOO: a fingerprint database of discrete objects
Permutation group algorithms based on directed 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
Minimal extending sets in tournaments
A proof system for graph (non)-isomorphism verification
Distinguishing graphs with zeta functions and generalized spectra
Short certificates for chromatic equivalence
Mixed-integer programming techniques for the connected max-$k$-cut problem
The Schläfli Fan
Biregular graphs with three eigenvalues
Binary determinantal complexity
Improved static symmetry breaking for SAT
Orbital independence in symmetric mathematical programs
Integer programming for classifying orthogonal arrays
Small $f$-vectors of 3-spheres and of 4-polytopes
Conics in sextic $K3$-surfaces in $\mathbb{P}^4$
Isomorphism and invariants of parallelisms of projective spaces
Mappings of Butson-type Hadamard matrices
On Ryser's conjecture for linear intersecting multipartite hypergraphs
The algebraic matroid of the finite unit norm tight frame (funtf) variety
Switching in one-factorisations of complete graphs
On the minimum weights of binary linear complementary dual codes
Title not available (Why is that?)
Enumerating partial Latin rectangles
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
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
Algebraic polytopes in Normaliz
Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
Generating all finite modular lattices of a given size
On the resistance diameters of graphs and their line graphs
4-cop-win graphs have at least 19 vertices
16,051 formulas for Ottaviani's invariant of cubic threefolds
On maximal relative projection constants

This page was built for software: Traces