Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees

Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle. Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb., 66:191-234, 2017. [doi]

Abstract

Abstract is missing.