Definability equals recognizability for graphs of bounded treewidth.

Mikolaj Bojanczyk, Michal Pilipczuk

Browse the full LICS paper archive.