The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2007.10.046 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020917861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite presentations of infinite structures: Automata and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regular structure of prefix rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On better quasi-ordering countable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. IV: Definability properties of equational graphs / 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: The monadic second-order logic of graphs. IX: Machines and their behaviours / 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: Clique-width of countable graphs: A compactness property. / 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: The monadic second-order logic of graphs. XV: On a conjecture by D. Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs XVI : Canonical graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The evaluation of first-order substitution is monadic second-order compatible / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitivity is hereditary for 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4492680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of relations. Transl. from the French by P. Clote / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4297398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2007.10.046 / rank
 
Normal rank

Latest revision as of 23:20, 18 December 2024

scientific article
Language Label Description Also known as
English
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
scientific article

    Statements

    The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (English)
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    modular decomposition
    0 references
    tree
    0 references
    linear order
    0 references
    monadic second-order logic
    0 references
    monadic second-order transduction
    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