Pages that link to "Item:Q4635898"
From MaRDI portal
The following pages link to Definability equals recognizability for graphs of bounded treewidth (Q4635898):
Displaying 15 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (Q1578419) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Recognizability equals definability for partial k-paths (Q4572008) (← links)
- (Q4580330) (← links)
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496) (← links)
- (Q5028434) (← links)
- (Q5028484) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- \(K_4\)-free graphs as a free algebra (Q5111293) (← links)
- (Q5207048) (← links)
- Definability Equals Recognizability for $k$-Outerplanar Graphs (Q5363771) (← links)
- (Q5856407) (← links)
- Monadic monadic second order logic (Q6612795) (← links)