Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm

As is well known, the isomorphism problem for vertex-colored graphs with color multiplicity at most 3 is solvable by the classical two-dimensional Weisfeiler--Leman algorithm (2-WL). On the other h...