Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width and the speed of hereditary properties / 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: Q5111290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced minors and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample regarding labelled well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width and edge contraction / 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: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring diamond-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding clique-width via perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width and well-quasi-ordering of triangle-free graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering versus clique-width: new results on bigenic classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the clique-width of \(H\)-free bipartite graphs / 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: Subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The behavior of clique-width under graph operations and graph transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint paths problem in quadratic time / 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: Well-quasi-ordering \(H\)-contraction-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two forbidden induced subgraphs and well-quasi-ordering / 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: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering versus clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wohlquasigeordnete Klassen endlicher Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSOL partitioning problems on graphs of bounded treewidth and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank

Revision as of 03:30, 21 July 2024

scientific article; zbMATH DE number 7138705
Language Label Description Also known as
English
Clique-width and well-quasi-ordering of triangle-free graph classes
scientific article; zbMATH DE number 7138705

    Statements

    Clique-width and well-quasi-ordering of triangle-free graph classes (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2019
    0 references
    clique-width
    0 references
    forbidden induced subgraph
    0 references
    hereditary graph class
    0 references
    well-quasi-ordering
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references