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.
Download/Full Text
Open Access version via Utrecht University Repository Publisher version
 
Keywords: Automata, Chordality, Definability, Logic, Recognizability, Treewidth, Taverne, Discrete Mathematics and Combinatorics, Applied Mathematics
DOI: https://doi.org/10.1016/j.endm.2015.06.076
ISSN: 1571-0653
Publisher: Elsevier
(Peer reviewed)
 
See more statistics about this item