It is proved that the Weisfeiler-Leman dimension of the class of permuta...
An arc-colored tournament is said to be k-spanning for an integer kâ‰¥ 1
i...
It is known that testing isomorphism of chordal graphs is as hard as the...
A Cartesian decomposition of a coherent configuration X is defined as
a ...
A graph is said to be distance-hereditary if the distance function in ev...
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful
com...
The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a very useful
com...
The 2-closure G of a permutation group G on Î© is
defined to be the large...
We show that the 2-dimensional Weisfeiler-Leman algorithm stabilizes n-v...
A graph is said to be circular-arc if the vertices can be associated wit...
Let K be a class of combinatorial objects invariant with respect to
a g...
We prove that the Weisfeiler-Leman (WL) dimension of the class of all fi...