Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
From MaRDI portal
Publication:1964591
Recommendations
Cited in
(14)- Graph algebras and the graph isomorphism problem
- Isomorphism testing of k-spanning tournaments is fixed parameter tractable
- Colored hypergraph isomorphism is fixed parameter tractable
- Permutation group approach to association schemes
- Graph isomorphism parameterized by elimination distance to bounded degree
- Two inequalities for parameters of a cellular algebra
- scientific article; zbMATH DE number 910921 (Why is no real title available?)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity
- On the geometric graph isomorphism problem
- Graph isomorphism restricted by lists
- On testing isomorphism of graphs of bounded eigenvalue multiplicity
- Circulant graphs: recognizing and isomorphism testing in polynomial time
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs
- scientific article; zbMATH DE number 2086379 (Why is no real title available?)
This page was built for publication: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964591)