1. Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. (December 2017) Authors: Jaffke, Lars; Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne Journal: European journal of combinatorics Issue: Volume 66(2017) Page Start: 191 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗