Definability equals recognizability for $k$-outerplanar graphs

L. Jaffke, H.L. Bodlaender

Research output: Book/ReportReportAcademic

25 Downloads (Pure)


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 linear time for graphs of bounded treewidth, which is known as Courcelle's Theorem. These algorithms are constructed as finite state tree automata, and hence every CMSOL-definable graph property is recognizable. Courcelle also conjectured that the converse holds, i.e. every recognizable graph property is definable in CMSOL for graphs of bounded treewidth. We prove this conjecture for $k$-outerplanar graphs, which are known to have treewidth at most $3k-1$.
Original languageEnglish
Number of pages40
Publication statusPublished - 2015

Publication series

Volume1509.08315 [cs.LO]

Bibliographical note

40 pages, 8 figures


  • cs.LO
  • math.CO


Dive into the research topics of 'Definability equals recognizability for $k$-outerplanar graphs'. Together they form a unique fingerprint.

Cite this