The monadic second-order logic of graphs. X: Linear orderings

From MaRDI portal
Publication:1366538

DOI10.1016/0304-3975(95)00083-6zbMath0877.68087OpenAlexW2059287145MaRDI QIDQ1366538

Bruno Courcelle

Publication date: 18 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00083-6



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (24)

Trees, grids, and MSO decidability: from graphs to matroidsInduced betweenness in order-theoretic treesMonadic second-order definable text languagesVertex-minors, monadic second-order logic, and a conjecture by SeeseDefinability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-treesSpined categories: generalizing tree-width beyond graphsA monadic second-order definition of the structure of convex hypergraphs.Clique-width of countable graphs: A compactness property.The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphsUpper bounds to the clique width of graphsThe monadic second-order logic of graphs. IX: Machines and their behavioursCircle graphs and monadic second-order logicThe modular decomposition of countable graphs. Definition and construction in monadic second-order logicGETGRATSComputer science and the fine structure of Borel setsThe monadic second-order logic of graphs. XV: On a conjecture by D. SeeseComputations by fly-automata beyond monadic second-order logicTowards a characterization of order-invariant queries over tame graphsPomset Languages of Finite Step Transition SystemsNondeterministic operations on finite relational structuresThe monadic second-order logic of graphs. XII: Planar graphs and planar mapsThe recognizability of sets of graphs is a robust propertyCounting modulo quantifiers on finite structuresLinear time and the power of one first-order universal quantifier



Cites Work


This page was built for publication: The monadic second-order logic of graphs. X: Linear orderings