@article{48e688fd945c4e7abdcdd5f23ff1e7a3,
title = "Recognizability equals definability for graphs of bounded treewidth and bounded chordality",
abstract = "We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is definable in counting monadic second-order logic.",
keywords = "Automata, Chordality, Definability, Logic, Recognizability, Treewidth",
author = "H.L. Bodlaender and P. Heggernes and J.A. Telle",
year = "2015",
month = nov,
day = "1",
doi = "10.1016/j.endm.2015.06.076",
language = "English",
volume = "49",
pages = "559--568",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",
}