The WL test [1]} is a popular heuristic for the graph isomorphism problem. While the exact complexity of this problem remains unknown [2]}, the WL test is a powerful heuristic capable of distinguishing a large family of graphs [3]}.
