A model-theoretic characterisation of clique width (Q2503407): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.apal.2006.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077862629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order quantifiers and the complexity of theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizability, hypergraph operations, and logical types / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. VII: Graphs as relational structures / 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: 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: Q4736878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Théories d'arbres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / 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: Q5668796 / 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: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:26, 24 June 2024

scientific article
Language Label Description Also known as
English
A model-theoretic characterisation of clique width
scientific article

    Statements

    A model-theoretic characterisation of clique width (English)
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    clique width
    0 references
    monadic second-order logic
    0 references
    model theory
    0 references
    VC-dimension
    0 references
    0 references