Isomorphism, Canonization, and Definability for Graphs of Bounded Rank Width
In this paper we study the graph isomorphism problem and the closely related graph canonization problem as well as logical definability and descriptive complexity on graph classes of bounded rank width.
