A counterexample regarding labelled well-quasi-ordering (Q1756107): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Vincent R. Vatter / rank
Normal rank
 
Property / author
 
Property / author: Vincent R. Vatter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964181817 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.10042 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124846948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelled induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split graphs of Dilworth number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching for permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing simple permutations, with enumerative consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-order of relabel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split Graphs Having Dilworth Number Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi-order in combinatorics: embeddings and homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary properties of well-quasi-ordered sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation classes / rank
 
Normal rank

Latest revision as of 21:06, 17 July 2024

scientific article
Language Label Description Also known as
English
A counterexample regarding labelled well-quasi-ordering
scientific article

    Statements

    A counterexample regarding labelled well-quasi-ordering (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    0 references
    labelled well-quasi-order
    0 references
    permutation graph
    0 references
    well-quasi-order
    0 references
    widdershins spiral
    0 references
    0 references
    0 references
    0 references