| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651945 | Electronic Notes in Discrete Mathematics | 2015 | 10 Pages |
Abstract
We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is definable in counting monadic second-order logic.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
