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

From MaRDI portal
Revision as of 22:20, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    title
    The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (English)
    0 references
    author
    Bruno Courcelle
    0 references
    Christian Delhommé
    0 references
    publication date
    15 April 2008
    0 references
    zbMATH Keywords
    modular decomposition
    0 references
    tree
    0 references
    linear order
    0 references
    monadic second-order logic
    0 references
    monadic second-order transduction
    0 references
    cites work
    Q4218128
    0 references
    Computer Science Logic
    0 references
    Q4385535
    0 references
    Computer Science Logic
    0 references
    Q3999150
    0 references
    Q4263467
    0 references
    Q4492680
    0 references
    Q3312199
    0 references
    Q4297398
    0 references
    Indecomposable graphs
    0 references
    Q4145882
    0 references
    Q3683903
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    03B15
    0 references
    05C70
    0 references
    zbMATH DE Number
    5264284
    0 references
    OpenAlex ID
    W2020917861
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2481975&oldid=39112494"
    Powered by MediaWiki