scientific article; zbMATH DE number 3639629
From MaRDI portal
Publication:4198513
Cited in
(24)- Classification of simple 2-(11,3,3) designs
- Directed strongly regular graphs obtained from coherent algebras
- Boundary uniqueness of fusenes
- Computers and discovery in algebraic graph theory
- Backtrack search for parallelisms of projective spaces
- Faradžev Read-type enumeration of non-isomorphic CC systems
- Breaking symmetries in graph search with canonizing sets
- Rank of adjacency matrices of directed (strongly) regular graphs
- Computing the maximal canonical form for trees in polynomial time
- The Paulus-Rozenfeld-Thompson graph on 26 vertices revisited and related combinatorial structures
- Largest Graphs of Diameter 2 and Maximum Degree 6
- Generation of union-closed sets and Moore families
- Isomorphism and invariants of parallelisms of projective spaces
- Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation
- Orderly generation of Butson Hadamard matrices
- Enumeration of Steiner triple systems with subsystems
- An adaptive prefix-assignment technique for symmetry reduction
- On the classification of skew Hadamard matrices of order 36 and related structures
- New results on periodic Golay pairs
- Near triple arrays
- A census of Cayley graphs
- Quasi-symmetric designs on 56 points
- New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8
- Complete catalogue of graphs of maximum degree 3 and defect at most 4
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198513)
