Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W3133901838 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.01628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and enumerating 321-avoiding and skew-merged simple permutations / 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: Split graphs of Dilworth number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bichain graphs: geometric model and universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean-width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitely many minimal classes of graphs of unbounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph operations characterizing rank-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for hereditary graph classes / 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: On canonical antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The plane-width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal classes of graphs of unbounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering versus clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter graphs and well-quasi-order by induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / 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. XX: Wagner's conjecture / rank
 
Normal rank

Latest revision as of 22:56, 24 July 2024

scientific article
Language Label Description Also known as
English
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
scientific article

    Statements

    Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 April 2021
    0 references
    clique-width
    0 references
    rank-width
    0 references
    hereditary class
    0 references
    universal graph
    0 references
    well-quasi-ordering
    0 references

    Identifiers