Pages that link to "Item:Q1366538"

The following pages link to The monadic second-order logic of graphs. X: Linear orderings (Q1366538):

Displaying 31 items.

• The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
• Circle graphs and monadic second-order logic (Q946577) (← links)
• Nondeterministic operations on finite relational structures (Q1276248) (← links)
• Monadic second-order definable text languages (Q1361884) (← links)
• A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
• Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
• The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
• Counting modulo quantifiers on finite structures (Q1854352) (← links)
• Linear time and the power of one first-order universal quantifier (Q1854556) (← links)
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
• Upper bounds to the clique width of graphs (Q1975365) (← links)
• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• The recognizability of sets of graphs is a robust property (Q2566292) (← links)
• Monadic second-order definable graph orderings (Q2871227) (← links)
• Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (Q3521904) (← links)
• On the Monadic Second-Order Transduction Hierarchy (Q3575301) (← links)
• Graph equivalences and decompositions definable in monadic second-order logic. The case of circle graphs (Q3615812) (← links)
• Towards a characterization of order-invariant queries over tame graphs (Q3616348) (← links)
• Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
• (Q4474837) (← links)
• The definition in monadic second-order logic of modular decompositions of ordered graphs (Q4645296) (← links)
• GETGRATS (Q4923529) (← links)
• Induced betweenness in order-theoretic trees (Q5038203) (← links)
• Computer science and the fine structure of Borel sets (Q5941255) (← links)
• Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
• Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)