Pages that link to "Item:Q4635898"

The following pages link to Definability equals recognizability for graphs of bounded treewidth (Q4635898):

Displaying 9 items.

• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
• (Q4580330) (← links)
• (Q5028434) (← links)
• (Q5028484) (← links)
• Computing Tree Decompositions (Q5042458) (← links)
• (Q5111293) (← links)
• (Q5207048) (← links)
• (Q5856407) (← links)
• Monadic monadic second order logic (Q6612795) (← links)