Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (Q1730221): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Labelled induced subgraphs and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for deciding the finiteness of the number of simple permutations in permutation classes / 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: Simple permutations: Decidability and unavoidable substructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable induced subgraphs in large graphs with no homogeneous sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growing Without Cloning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / 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: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closure of graphs under substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: All minimal prime extensions of hereditary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable graphs / 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: Q5668845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ 4\)-trees and substitution decomposition / rank
 
Normal rank

Revision as of 17:22, 18 July 2024

scientific article
Language Label Description Also known as
English
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
scientific article

    Statements

    Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 March 2019
    0 references
    0 references
    modular decomposition
    0 references
    induced subgraph
    0 references
    prime graph
    0 references
    homogeneous set
    0 references
    0 references
    0 references