Recognizability equals definability for graphs of bounded treewidth and bounded chordality | ORKG Ask

We use cookies to provide a better user experience.

Data Protection

Related items

Recognizability equals definability for graphs of bounded treewidth and bounded chordality

Bodlaender, H.L.
Heggernes, P.
Telle, J.A.

November 2015

We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is def...

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality

Bodlaender, Hans L.
Heggernes, Pinar
Telle, Jan Arne

November 2015

We prove that every recognizable family of graphs of bounded treewidth and bounded chordality is def...

Definability equals recognizability for $k$-outerplanar graphs

Jaffke, L.
Bodlaender, H.L.

January 2015

One of the most famous algorithmic meta-theorems states that every graph property that can be define...