The following pages link to (Q3312272):
Displaying 12 items.
- Asymptotic Delsarte cliques in distance-regular graphs (Q295820) (← links)
- Graph isomorphism and equality of simplices (Q1033986) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Graph isomorphism problem and \(2\)-closed permutation groups (Q1311608) (← links)
- On computation complexity problems concerning relation algebras (Q1329260) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Finding fixed point free elements and small bases in permutation groups (Q2357380) (← links)
- Spectrally Robust Graph Isomorphism (Q5002763) (← links)
- Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2 (Q5501618) (← links)
