Definability Equals Recognizability for $k$-Outerplanar Graphs
From MaRDI portal
Publication:5363771
DOI10.4230/LIPIcs.IPEC.2015.175zbMath1378.03032arXiv1509.08315MaRDI QIDQ5363771
Hans L. Bodlaender, Lars Jaffke
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1509.08315
treewidth; \(k\)-outerplanar graphs; monadic second-order logic of graphs; finite-state tree automata
DB lookup for MSC labels failed