Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

On the factorization of reducible properties of graphs into irreducible factors

100%

Mihók P., Vasky R.

Discussiones Mathematicae Graph Theory

1995

tom 15

nr 2

195-203

A hereditary property R of graphs is said to be reducible if there exist hereditary properties P₁,P₂ such that G ∈ R if and only if the set of vertices of G can be partitioned into V(G) = V₁∪V₂ so that ⟨V₁⟩ ∈ P₁ and ⟨V₂⟩ ∈ P₂. The problem of the factorization of reducible properties into irreducible factors is investigated.

Reducible properties of graphs

100%

Mihók P., Semanišin G.

Discussiones Mathematicae Graph Theory

1995

tom 15

nr 1

11-18

Let L be the set of all hereditary and additive properties of graphs. For P₁, P₂ ∈ L, the reducible property R = P₁∘P₂ is defined as follows: G ∈ R if and only if there is a partition V(G) = V₁∪ V₂ of the vertex set of G such that $⟨V₁⟩_G ∈ P₁$ and $⟨V₂⟩_G ∈ P₂$. The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the decomposition of a reducible property into irreducible ones.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Mihók P.

1 Semanišin G.

1 Vasky R.

2 1995

Wyniki wyszukiwania

On the factorization of reducible properties of graphs into irreducible factors

Reducible properties of graphs