Cited in
(only showing first 100 items - show all)- Complete and almost complete minors in double-critical 8-chromatic graphs
- The Hypermetric Cone on Seven Vertices
- Nested balanced incomplete block designs
- Special cycles in independence complexes and superfrustration in some lattices
- Enumerating cube tilings
- There is no \([21,5,14]\) code over \(\mathbb F_5\)
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- polyDB: a database for polytopes and related objects
- There exists no Steiner system \(S(4,5,17)\)
- Steiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\)
- The Mendelsohn triple systems of order 13
- On the number of frequency hypercubes F^n(4;2,2)
- On some interconnections between combinatorial optimization and extremal graph theory
- Subjectively interesting connecting trees and forests
- On the enumeration of minimal non-pairwise compatibility graphs
- Overlarge sets of 2-(11, 5, 2) designs and related configurations
- The minimality of the Georges-Kelmans graph
- Small latin squares, quasigroups, and loops
- Symmetry definitions for constraint satisfaction problems
- Cops and robbers on \(2K_2\)-free graphs
- scientific article; zbMATH DE number 1191226 (Why is no real title available?)
- A method for enumerating pairwise compatibility graphs with a given number of vertices
- Overlarge sets and partial geometries
- Attacks on hard instances of graph isomorphism
- Acyclic 3-coloring of generalized Petersen graphs
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
- scientific article; zbMATH DE number 2192153 (Why is no real title available?)
- A new partial geometry \(\mathrm{pg}(5,5,2)\)
- Classical symmetries and the quantum approximate optimization algorithm
- Smooth cubic surfaces with 15 lines
- The first player wins the one-colour triangle avoidance game on 16 vertices
- New lower bounds for multiple coverings
- Computation in permutation groups: Counting and randomly sampling orbits
- General embedding problems and two-distance sets in Minkowski planes
- Computing the autotopy group of a Latin square by cycle structure
- The 2-rotational Steiner triple systems of order 25
- Enumeration of generalized Hadamard matrices of order 16 and related designs
- On the Ramsey number R(4,6)
- 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
- The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments
- On some symmetric designs with classical parameters
- Permutation group algorithms based on directed graphs
- On self-clique shoal graphs
- A Note on Universal Point Sets for Planar Graphs
- Graphs with small spectral gap
- McKay's canonical graph labeling algorithm
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- scientific article; zbMATH DE number 2245884 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- Normal edge-transitive Cayley graphs of Frobenius groups
- 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
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- Linear optimization over permutation groups
- Iterative equitable partition of graph as a model of constant structure discrete time closed semantic system
- New difference sets in nonabelian groups of order 100
- scientific article; zbMATH DE number 1051281 (Why is no real title available?)
- 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
- Practical graph isomorphism. II.
- scientific article; zbMATH DE number 1405802 (Why is no real title available?)
- On efficient network similarity measures
- The 4-way intersection problem for kite systems
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Minimal strong digraphs
- A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
- Minimal extending sets in tournaments
- The minimum rank problem over the finite field of order 2: Minimum rank 3
- Relating centralities in graphs and the principal eigenvector of its distance matrix
- Fully gated graphs: Recognition and convex operations
- On the minimum leaf number of cubic graphs
- Spectral moments of regular graphs in terms of subgraph counts
- On a family of highly regular graphs by Brouwer, Ivanov, and Klin
- Classification of hyperovals in PG(2,32)
- Novel techniques to speed up the computation of the automorphism group of a graph
- Set-homogeneous directed graphs
- Kochen–Specker vectors
- Geometric realisation of the graphs of McKay-Miller-Širáň
- scientific article; zbMATH DE number 1191224 (Why is no real title available?)
- Classification of designs with nontrivial automorphism groups
- Orderly algorithm to enumerate central groupoids and their graphs
- Distinguishing graphs with zeta functions and generalized spectra
- A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\)
- Generalizing cographs to 2-cographs
- Most switching classes with primitive automorphism groups contain graphs with trivial groups
- Computation of new diagonal graph Ramsey numbers
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Eigenvalues of saturated hydrocarbons
- Voltage graphs, group presentations and cages
- Binary Relations and Permutation Groups
- The optimal packing of eight points in the real projective plane
- Automatic proof of graph nonisomorphism
- Uniqueness of graph square roots of girth six
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Counting graded lattices of rank 3 that have few coatoms
This page was built for software: nauty