On a Huge Family of Non-Schurian Schur Rings | 0 | 0.34 | 2022 |
The Weisfeiler-Leman algorithm and recognition of graph properties | 0 | 0.34 | 2021 |
Two-closure of supersolvable permutation group in polynomial time | 0 | 0.34 | 2020 |
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 | 1 | 0.35 | 2019 |
Testing isomorphism of circular-arc graphs in polynomial time. | 0 | 0.34 | 2019 |
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm | 0 | 0.34 | 2019 |
The Basis Digraphs of p-schemes | 0 | 0.34 | 2009 |
Permutation group approach to association schemes | 13 | 2.23 | 2009 |
Schur rings | 2 | 0.43 | 2009 |
Two-closure of odd permutation group in polynomial time | 1 | 0.40 | 2001 |
Forestal Algebras And Algebraic Forests (On A New Class Of Weakly Compact Graphs) | 6 | 0.58 | 2000 |
Compact cellular algebras and permutation groups | 4 | 0.54 | 1999 |
Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks | 13 | 0.69 | 1999 |