Pages that link to "Item:Q5363771"
From MaRDI portal
The following pages link to Definability Equals Recognizability for $k$-Outerplanar Graphs (Q5363771):
Displaying 8 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← 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)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- Recognizability equals definability for partial k-paths (Q4572008) (← links)
- Definability equals recognizability for graphs of bounded treewidth (Q4635898) (← links)
- (Q5028434) (← links)