Pages that link to "Item:Q1578419"

The following pages link to Definability equals recognizability of partial 3-trees and \(k\)-connected partial \(k\)-trees (Q1578419):

Displayed 6 items.

• Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) ‎ (← links)
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) ‎ (← 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)