Pages that link to "Item:Q4386451"

The following pages link to Isomorph-Free Exhaustive Generation (Q4386451):

Displaying 50 items.

• Computers and discovery in algebraic graph theory (Q1855400) (← links)
• A new lower bound for the football pool problem for six matches (Q1865378) (← links)
• Efficient exhaustive listings of reversible one dimensional cellular automata (Q1884849) (← links)
• The number of pessimistic guesses in generalized black-peg mastermind (Q1944171) (← links)
• Counting proper colourings in 4-regular graphs via the Potts model (Q1991414) (← links)
• Combinatorial games modeling seki in Go (Q2017043) (← links)
• On triangular matroids induced by \(n_3\)-configurations (Q2053539) (← links)
• Boosting isomorphic model filtering with invariants (Q2079277) (← links)
• Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs (Q2152271) (← links)
• Almost-equidistant sets (Q2175803) (← links)
• Optimal binary LCD codes (Q2234460) (← links)
• Algebraic conditions and the sparsity of spectrally arbitrary patterns (Q2236391) (← links)
• Constructing unlabelled lattices (Q2282992) (← links)
• The worst case number of questions in generalized AB game with and without white-peg answers (Q2341748) (← links)
• Exhaustive search for snake-in-the-box codes (Q2354613) (← links)
• Characteristic-independence of Betti numbers of graph ideals (Q2368652) (← links)
• Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
• Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
• Cocyclic Hadamard matrices over Latin rectangles (Q2422231) (← links)
• On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
• G-Tries: a data structure for storing and finding subgraphs (Q2435716) (← links)
• Graphs whose complement and square are isomorphic (Q2449164) (← links)
• Symmetric ILP: Coloring and small integers (Q2471273) (← links)
• Matroids with nine elements (Q2477632) (← links)
• Equivalence-free exhaustive generation of matroid representations (Q2495901) (← links)
• On the binary projective codes with dimension 6 (Q2499590) (← links)
• Support measures for graph data (Q2508500) (← links)
• On directed-convex polyominoes in a rectangle (Q2566276) (← links)
• Chromatic-index-critical graphs of orders 13 and 14 (Q2570100) (← links)
• Classification of three-class association schemes using backtracking with dynamic variable ordering (Q2570104) (← links)
• Generation of simple quadrangulations of the sphere (Q2581402) (← links)
• Construction of planar triangulations with minimum degree 5 (Q2581624) (← links)
• Characterizing 2-crossing-critical graphs (Q2635081) (← links)
• Generating effective symmetry-breaking predicates for search problems (Q2643299) (← links)
• Fast generation of some classes of planar graphs (Q2741325) (← links)
• Generating effective symmetry-breaking predicates for search problems (Q2741511) (← links)
• Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
• On the classification of Hadamard matrices of order 32 (Q3057079) (← links)
• The complete k-arcs of PG(2, 27) and PG(2, 29) (Q3084612) (← links)
• On Searching for Small Kochen-Specker Vector Systems (Q3104762) (← links)
• The complete (k, 3)-arcs of PG(2,q), q≤13 (Q3165561) (← links)
• The number of Latin squares of order 11 (Q3168748) (← links)
• Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
• Constraint Orbital Branching (Q3503850) (← links)
• A full classification of the complete <i>k</i>‐arcs of PG(2,23) and PG(2,25) (Q3578143) (← links)
• Recursive Generation of 5-Regular Planar Graphs (Q3605492) (← links)
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
• Generating All Triangulations of Plane Graphs (Extended Abstract) (Q3605494) (← links)
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of<i>K</i>₁₄ (Q3619607) (← links)
• (Q3694165) (← links)