On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties

V. Arvind, Frank Fuhlbrück, Johannes Köbler +1

The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a fruitful approach to the Graph Isomorphism problem. 2-WL corresponds to the original algorithm suggested by Weisfeiler…