Pages that link to "Item:Q1842126"

The following pages link to The monadic second-order logic of graphs. VIII: Orientations (Q1842126):

Displaying 15 items.

• Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
• The complexity of two graph orientation problems (Q412352) (← links)
• Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
• Circle graphs and monadic second-order logic (Q946577) (← links)
• Nondeterministic operations on finite relational structures (Q1276248) (← links)
• The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
• A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
• The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← 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)
• A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• (Q5079746) (← links)