29 citations · 63 across the 22 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 2 cited
Definability Equals Recognizability for -Outerplanar Graphs
Lars Jaffke, Hans L. Bodlaender
One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in…
cs.LO2015★ 5 cited
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree -Outerplanar Graphs
Lars Jaffke, Hans L. Bodlaender
One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in…