Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality

We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is definable in counting monadic second-order logic.