The monadic second-order logic of graphs. X: Linear orderings (Q1366538): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(95)00083-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2059287145
@@ Property / OpenAlex ID: W2059287145 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of traces
@@ Property / cites work: Theory of traces / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Asynchronous mappings and asynchronous cellular automata
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatic definition of context-free rewriting and its application to NLC graph grammars
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VII: Graphs as relational structures
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. VIII: Orientations
+Normal rank
@@ Property / cites work @@
+The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
+Normal rank
@@ Property / cites work @@
+Monadic second-order definable graph transductions: a survey
+Normal rank
@@ Property / cites work @@
+Recognizable sets of graphs: equivalent definitions and closure properties
+Normal rank
@@ Property / cites work @@
+Structural properties of context-free sets of graphs generated by vertex replacement
+Normal rank
@@ Property / cites work @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+Logical definability on infinite traces
@@ Property / cites work: Logical definability on infinite traces / rank @@
+Normal rank
@@ Property / cites work @@
+Q4179852
@@ Property / cites work: Q4179852 / rank @@
+Normal rank
@@ Property / cites work @@
+How to define a linear order on finite models
@@ Property / cites work: How to define a linear order on finite models / rank @@
+Normal rank
@@ Property / cites work @@
+MSO definable text languages
@@ Property / cites work: MSO definable text languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284261
@@ Property / cites work: Q4284261 / rank @@
+Normal rank
@@ Property / cites work @@
+Separating subgraphs in k-trees: Cables and caterpillars
+Normal rank
@@ Property / cites work @@
+Graphs indecomposable with respect to the X-join
@@ Property / cites work: Graphs indecomposable with respect to the X-join / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221429
@@ Property / cites work: Q3221429 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385530
@@ Property / cites work: Q4385530 / rank @@
+Normal rank