The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q248922
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bruno Courcelle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W182050876 / 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: Q4037299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite hypergraphs. I: Basic properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694755 / 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, II: Infinite graphs of bounded width / 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: 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: Q4385531 / 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: Q3785988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Variants of the Bandwidth Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097268 / 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: Q4385515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036591 / rank
 
Normal rank

Latest revision as of 13:22, 16 May 2024

scientific article
Language Label Description Also known as
English
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
scientific article

    Statements

    The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (English)
    0 references
    27 September 1992
    0 references
    graphs
    0 references
    hypergraphs
    0 references
    formal language
    0 references
    tree-decompositions
    0 references
    monadic second-order logic
    0 references
    minors
    0 references
    quadratic algorithms
    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

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references