The following pages link to nauty (Q13366):
Displaying 50 items.
- Block designs and strongly regular graphs constructed from the group U(3,4) (Q5296371) (← links)
- Extremal Graphs With a Given Number of Perfect Matchings (Q5325953) (← links)
- (Q5358292) (← links)
- Polymake: an approach to modular software design in computational geometry (Q5361580) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- Digraphs with at most one trivial critical ideal (Q5375920) (← links)
- Short certificates for chromatic equivalence (Q5377353) (← links)
- Constructing Hard Examples for Graph Isomorphism (Q5377355) (← links)
- (Q5383191) (← links)
- Detecting Orbitopal Symmetries (Q5392087) (← links)
- The Mendelsohn Triple Systems of Order 13 (Q5406954) (← links)
- On the Enumeration of ‐Optimal and Minimax‐Optimal <i>k</i>‐Circulant Supersaturated Designs (Q5414315) (← links)
- (Q5414580) (← links)
- (Q5422525) (← links)
- (Q5423105) (← links)
- (Q5423116) (← links)
- Orbital Branching (Q5429261) (← links)
- (Q5441057) (← links)
- (Q5442390) (← links)
- (Q5448211) (← links)
- (Q5454406) (← links)
- Finite linear spaces consisting of two symmetric configurations (Q5462032) (← links)
- (Q5463527) (← links)
- (Q5466089) (← links)
- AI*IA 2005: Advances in Artificial Intelligence (Q5475741) (← links)
- (Q5477963) (← links)
- (Q5477971) (← links)
- Enumeration of Steiner triple systems with subsystems (Q5501161) (← links)
- Using Symmetry to Improve Percolation Threshold Bounds (Q5696363) (← links)
- (Q5699656) (← links)
- Network Analysis (Q5703973) (← links)
- (Q5716923) (← links)
- (Q5717950) (← links)
- Classification of Graeco-Latin Cubes (Q5744161) (← links)
- Graphs with small spectral gap (Q5746814) (← links)
- The Reformulation-Optimization Software Engine (Q5747897) (← links)
- Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree (Q5854457) (← links)
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory (Q5864695) (← links)
- Switching for Small Strongly Regular Graphs (Q5869433) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Algorithms - ESA 2003 (Q5897283) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918527) (← links)
- The resolution of Keller's conjecture (Q5918545) (← links)
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
- Algorithms for Greechie diagrams (Q5928533) (← links)
- Nested balanced incomplete block designs (Q5937603) (← links)
- Some new Hadamard designs with 79 points admitting automorphisms of order 13 and 19 (Q5943885) (← links)
- Counting configurations in designs (Q5953380) (← links)
