5 citations · 10 across the 9 of their papers we have counts for
1 paper · 1 filter
Mikołaj Bojańczyk, Michał Pilipczuk
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is re…