Pages that link to "Item:Q807611"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611):

Displaying 23 items.

Isomorphisms and algorithmic properties of structures with two equivalences (Q321265) (← links)
Querying probabilistic business processes for sub-flows (Q359875) (← links)
Automorphism groups of context-free graphs (Q671518) (← links)
The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
\(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
Automatic graphs and D0L-sequences of finite graphs (Q1877692) (← links)
Deciding the isomorphism problem in classes of unary automatic structures (Q2430013) (← links)
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
Simple monadic theories and partition width (Q3170562) (← links)
The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
On context-free sets of graphs and their monadic second-order theory (Q3785987) (← links)
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
(Q4205068) (← links)
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic (Q4333462) (← links)
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)