Pages that link to "Item:Q1176232"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232):
Displaying 10 items.
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Regular-factors in the complements of partial k-trees (Q5057452) (← links)
- (Q5089180) (← links)
- Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
- MSO definable text languages (Q5096900) (← links)
- \(K_4\)-free graphs as a free algebra (Q5111293) (← links)
- (Q5207048) (← links)
- Definability Equals Recognizability for $k$-Outerplanar Graphs (Q5363771) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Definability equals recognizability of partial 3-trees (Q6550548) (← links)