Pages that link to "Item:Q1964591"
From MaRDI portal
The following pages link to Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks (Q1964591):
Displaying 10 items.
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- Permutation group approach to association schemes (Q1039422) (← links)
- Graph algebras and the graph isomorphism problem (Q1328437) (← links)
- On the geometric graph isomorphism problem (Q1358911) (← links)
- Two inequalities for parameters of a cellular algebra (Q1966345) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)