Trees, grids, and MSO decidability: from graphs to matroids (Q820150): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q957020
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Detlef Seese / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999958048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3884080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / 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. 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: Structural properties of context-free sets of graphs generated by vertex replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. X: Linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. XII: Planar graphs and planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory. An introduction to large cardinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first order properties of products of algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Undecidability of Theories of Groupoids with an Extra Predicate / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the excluded minors for the matroids of branch-width \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic theory of order and topology, I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic theory of order and topology. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of <i>ω</i><sub>2</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic theory of order and topology in ZFC / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory and the ''next world'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strength of the interpretation method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5680120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretierbarkeit in der Gruppentheorie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parametrized Algorithm for Matroid Branch-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the models of decidable monadic theories of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphic matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on monadic logic. Part B: Complexity of linear orders in ZFC / rank
 
Normal rank

Latest revision as of 11:51, 24 June 2024

scientific article
Language Label Description Also known as
English
Trees, grids, and MSO decidability: from graphs to matroids
scientific article

    Statements

    Trees, grids, and MSO decidability: from graphs to matroids (English)
    0 references
    0 references
    0 references
    6 April 2006
    0 references
    graph
    0 references
    matroid
    0 references
    branch-width
    0 references
    tree-width
    0 references
    clique-width
    0 references
    grids
    0 references
    spikes
    0 references
    decidability
    0 references
    interpretability
    0 references
    monadic second-order logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers