Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: join in the lattice

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

A note on joins of additive hereditary graph properties

100%

Drgas-Burchardt E.

Discussiones Mathematicae Graph Theory

2006

tom 26

nr 3

413-418

Let $L^a$ denote a set of additive hereditary graph properties. It is a known fact that a partially ordered set $(L^a, ⊆ )$ is a complete distributive lattice. We present results when a join of two additive hereditary graph properties in $(L^a, ⊆ )$ has a finite or infinite family of minimal forbidden subgraphs.

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

88%

Drgas-Burchardt E.

Discussiones Mathematicae Graph Theory

2009

tom 29

nr 2

263-274

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

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Drgas-Burchardt E.

1 2009

1 2006

Wyniki wyszukiwania

A note on joins of additive hereditary graph properties

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