The following pages link to Practical graph isomorphism. II. (Q2437295):
Displaying 50 items.
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
- Quantum and non-signalling graph isomorphisms (Q2421559) (← links)
- On some edge Folkman numbers, small and large (Q2424295) (← links)
- Plurigraph coloring and scheduling problems (Q2628259) (← links)
- Structural and computational results on platypus graphs (Q2656702) (← links)
- Minimum spanning tree cycle intersection problem (Q2656964) (← links)
- The SU(3) spin model with chemical potential by series expansion techniques (Q2657738) (← links)
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian (Q2662552) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- \(c_2\) invariants of hourglass chains via quadratic denominator reduction (Q2666006) (← links)
- Counting orientations of graphs with no strongly connected tournaments (Q2675820) (← links)
- Recursive computation of Feynman periods (Q2678223) (← links)
- Group divisible designs with block size 4 where the group sizes are congruent to \(1 \bmod 3\) (Q2685311) (← links)
- On the Laplacian spread of digraphs (Q2689149) (← links)
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) (Q2693019) (← links)
- On the seven non-isomorphic solutions of the fifteen schoolgirl problem (Q2699907) (← links)
- Enumeration of MOLS of small order (Q2792342) (← links)
- An enumeration of certain projective ternary two-weight codes (Q2808796) (← links)
- Improved Static Symmetry Breaking for SAT (Q2818005) (← links)
- Computing Maximum Unavoidable Subgraphs Using SAT Solvers (Q2818013) (← links)
- Graphs Identified by Logics with Counting (Q2946347) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
- Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2 (Q2953120) (← links)
- Hyperbolic Triangular Buildings Without Periodic Planes of Genus 2 (Q2969996) (← links)
- Symmetry Breaking Constraints for the Minimum Deficiency Problem (Q2971392) (← links)
- Efficient Graph Kernels for Textual Entailment Recognition (Q3100178) (← links)
- Solving computational problems in the theory of word-representable graphs (Q3120420) (← links)
- (Q3120651) (← links)
- Small $f$-vectors of 3-spheres and of 4-polytopes (Q3177727) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Enumerating Neighborly Polytopes and Oriented Matroids (Q3194584) (← links)
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ (Q3300687) (← links)
- Hamiltonian Maker–Breaker Games on Small Graphs (Q3383707) (← links)
- Partial linear spaces with a rank 3 affine primitive group of automorphisms (Q3384031) (← links)
- (Q3385652) (← links)
- Classification of MDS Codes over Small Alphabets (Q3460469) (← links)
- Orbital Independence in Symmetric Mathematical Programs (Q3467864) (← links)
- Coarse-grained entanglement classification through orthogonal arrays (Q4583103) (← links)
- Logic Programming with Graph Automorphism: Integrating<tt>nauty</tt>with Prolog (Tool Description) (Q4593050) (← links)
- Equimatchable Regular Graphs (Q4604013) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- (Q4616102) (← links)
- (Q4616114) (← links)
- Borderenergetic Graphs of Order 12 (Q4617718) (← links)
- Order nine MMIK graphs (Q4635096) (← links)
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
- The chromatic number of the square of the $8$-cube (Q4640334) (← links)
- Generating symmetric graphs (Q4644733) (← links)
- Iterative Equitable Partition of Graph as a Model of Constant Structure Discrete Time Closed Semantic System (Q4692095) (← links)
- Error Thresholds for Arbitrary Pauli Noise (Q4957914) (← links)
