Pages that link to "Item:Q4572008"
From MaRDI portal
The following pages link to Recognizability equals definability for partial k-paths (Q4572008):
Displayed 8 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← 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)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Recognizability equals definability for partial k-paths (Q4572008) (← links)