Pages that link to "Item:Q1336623"

The following pages link to The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623):

Displayed 20 items.

• Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) ‎ (← links)
• Logical aspects of Cayley-graphs: the group case (Q705541) ‎ (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) ‎ (← links)
• The acircuitic directed star arboricity of subcubic graphs is at most four (Q856877) ‎ (← links)
• MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) ‎ (← links)
• Computing with graph rewriting systems with priorities (Q1261464) ‎ (← links)
• Good and semi-strong colorings of oriented planar graphs (Q1334637) ‎ (← links)
• The monadic second-order logic of graphs. X: Linear orderings (Q1366538) ‎ (← links)
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) ‎ (← links)
• The closure of monadic NP (Q1577017) ‎ (← links)
• The monadic second-order logic of graphs. VIII: Orientations (Q1842126) ‎ (← 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)
• Recognizability, hypergraph operations, and logical types (Q2496296) ‎ (← links)
• On the oriented chromatic number of graphs with given excess (Q2497471) ‎ (← links)
• The recognizability of sets of graphs is a robust property (Q2566292) ‎ (← links)
• Oriented vertex and arc colorings of partial 2-trees (Q3503473) ‎ (← links)
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) ‎ (← links)
• (Q4852905) ‎ (← links)
• On spectra of sentences of monadic second order logic with counting (Q5311744) ‎ (← links)