Definability in the substructure ordering of simple graphs (Q259729): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s00026-015-0295-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2269626665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. I: Finite semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. II: Finite ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. III: Finite distributive lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in substructure orderings. IV: Finite lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the lattice of equational theories of semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in lattices of equational theoris / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs and poset dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The falsity of the reconstruction conjecture for tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable theories / rank
 
Normal rank

Latest revision as of 16:02, 11 July 2024

scientific article
Language Label Description Also known as
English
Definability in the substructure ordering of simple graphs
scientific article

    Statements

    Definability in the substructure ordering of simple graphs (English)
    0 references
    0 references
    18 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    first-order definability
    0 references
    induced subgraphs
    0 references
    ordered set
    0 references
    universal classes
    0 references
    0 references