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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous mappings and asynchronous cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. VIII: Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second order logic of graphs. VI: On several representations of graphs by relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable graph transductions: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable sets of graphs: equivalent definitions and closure properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of context-free sets of graphs generated by vertex replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical definability on infinite traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to define a linear order on finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSO definable text languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating subgraphs in k-trees: Cables and caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs indecomposable with respect to the X-join / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank

Latest revision as of 18:47, 27 May 2024

scientific article
Language Label Description Also known as
English
The monadic second-order logic of graphs. X: Linear orderings
scientific article

    Statements

    The monadic second-order logic of graphs. X: Linear orderings (English)
    0 references
    0 references
    18 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    relational structures
    0 references
    0 references