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

DOI10.1016/j.ejc.2017.06.025zbMath1369.05048WikidataQ59567372 ScholiaQ59567372MaRDI QIDQ2403697

Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle, Lars Jaffke

Publication date: 11 September 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.06.025

zbMATH Keywords

definability; \(l\)-chordal partial \(k\)-trees; Courcelle's conjecture

Mathematics Subject Classification ID

05C05: Trees

05C10: Planar graphs; geometric and topological aspects of graph theory

68Q70: Algebraic theory of languages and automata

05C75: Structural characterization of families of graphs

03C40: Interpolation, preservation, definability