Pages that link to "Item:Q4386451"
From MaRDI portal
The following pages link to Isomorph-Free Exhaustive Generation (Q4386451):
Displaying 50 items.
- On strongly asymmetric and controllable primitive graphs (Q335330) (← links)
- A note on non-reconstructible 3-hypergraphs (Q343751) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- Generation of various classes of trivalent graphs (Q391389) (← links)
- Enumerating cube tilings (Q393746) (← links)
- New Kochen-Specker sets in four dimensions (Q414976) (← links)
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- On the maximum length of coil-in-the-box codes in dimension 8 (Q477349) (← links)
- On hypercube packings, blocking sets and a covering problem (Q477608) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- Recursive generation of IPR fullerenes (Q498482) (← links)
- Generating maps on surfaces (Q517449) (← links)
- Feynman graph generation and calculations in the Hopf algebra of Feynman graphs (Q525745) (← links)
- Multi-Latin squares (Q539869) (← links)
- Classification of triangle-free \(22_3\) configurations (Q606427) (← links)
- Fractionation in planar kinematic chains: reconciling enumeration contradictions (Q612683) (← links)
- Numerical measures for two-graphs (Q627376) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\) (Q697981) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- Generating all finite modular lattices of a given size (Q745707) (← links)
- Quasi-symmetric designs on 56 points (Q825929) (← links)
- The Steiner quadruple systems of order 16 (Q855876) (← links)
- Old and new results on algebraic connectivity of graphs (Q876302) (← links)
- Orderly algorithm to enumerate central groupoids and their graphs (Q884884) (← links)
- The number of pessimistic guesses in Generalized Mastermind (Q987843) (← links)
- Classification of simple 2-(11,3,3) designs (Q1011489) (← links)
- GrInvIn in a nutshell (Q1029769) (← links)
- Graph based isomorph-free generation of two-level regular fractional factorial designs (Q1036716) (← links)
- Generating water clusters and other directed graphs (Q1037502) (← links)
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds (Q1041614) (← links)
- Classification of Griesmer codes and dual transform (Q1043574) (← links)
- A general backtrack algorithm for the isomorphism problem of combinatorial objects (Q1087556) (← links)
- 3- and 4-critical graphs of small even order (Q1357738) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Efficient generation of triconnected plane triangulations. (Q1428112) (← links)
- A classification of the six-point prime metrics (Q1582489) (← links)
- An orderly algorithm and some applications in finite geometry (Q1584240) (← links)
- Boundary uniqueness of fusenes (Q1602690) (← links)
- An inductive definition of cubic toroidal maps (Q1613370) (← links)
- A Kochen-Specker system has at least 22 vectors (Q1670503) (← links)
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\) (Q1680880) (← links)
- Enumeration of Seidel matrices (Q1686262) (← links)
- Symmetries of unlabelled planar triangulations (Q1700803) (← links)
- The sextuply shortened binary Golay code is optimal (Q1727350) (← links)
- A computer-assisted proof of the uniqueness of the Perkel graph (Q1766104) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- Backtrack search with isomorph rejection and consistency check (Q1825676) (← links)
- Miscellaneous classification results for 2-designs (Q1827673) (← links)
- Efficient generation of plane trees. (Q1853129) (← links)
