On first-order definitions of subgraph isomorphism properties (Q679970): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Random graphs: models and asymptotic characteristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / 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: Polynomial bounds for the grid-minor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one \(k\)-law / rank
 
Normal rank

Revision as of 00:37, 15 July 2024

scientific article
Language Label Description Also known as
English
On first-order definitions of subgraph isomorphism properties
scientific article

    Statements

    On first-order definitions of subgraph isomorphism properties (English)
    0 references
    0 references
    22 January 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references