Abstract
We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is definable in counting monadic second-order logic.
Original language | English |
---|---|
Pages (from-to) | 559-568 |
Number of pages | 10 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 49 |
DOIs | |
Publication status | Published - 1 Nov 2015 |
Keywords
- Automata
- Chordality
- Definability
- Logic
- Recognizability
- Treewidth