1 research outputs found

    Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties

    No full text
    An additive hereditary graph property is any class of simple graphs, which is closed under isomorphisms unions and taking subgraphs. Let LaL^a denote a class of all such properties. In the paper, we consider H-reducible over LaL^a properties with H being a fixed graph. The finiteness of the sets of all minimal forbidden graphs is analyzed for such properties
    corecore