Technical Perspective: A Logical Step Toward the Graph Isomorphism Problem
In "Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width," Grohe and Neuen show that the Weisfeiler-Leman algorithm in its plain form solves the isomorphism problem for bounded-rank width graphs.