Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323)

From MaRDI portal
Revision as of 21:00, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567455, #quickstatements; #temporary_batch_1711565664090)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Recognizability equals definability for graphs of bounded treewidth and bounded chordality
scientific article

    Statements

    Recognizability equals definability for graphs of bounded treewidth and bounded chordality (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automata
    0 references
    recognizability
    0 references
    logic
    0 references
    definability
    0 references
    treewidth
    0 references
    chordality
    0 references
    0 references
    0 references