Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
DSpace/Manakin Repository
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne
(2015) Electronic Notes in Discrete Mathematics, volume 49, pp. 559 - 568
(Article)
Abstract
We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is definable in counting monadic second-order logic. show less