Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

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

On the completeness of decomposable properties of graphs

100%

Hałuszczak M., Vateha P.

Discussiones Mathematicae Graph Theory

1999

tom 19

nr 2

229-236

Let 𝓟₁,𝓟₂ be additive hereditary properties of graphs. A (𝓟₁,𝓟₂)-decomposition of a graph G is a partition of E(G) into sets E₁, E₂ such that induced subgraph $G[E_i]$ has the property $𝓟_i$, i = 1,2. Let us define a property 𝓟₁⊕𝓟₂ by {G: G has a (𝓟₁,𝓟₂)-decomposition}. A property D is said to be decomposable if there exists nontrivial additive hereditary properties 𝓟₁, 𝓟₂ such that D = 𝓟₁⊕𝓟₂. In this paper we determine the completeness of some decomposable properties and we characterize the decomposable properties of completeness 2.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Hałuszczak M.

1 Vateha P.

1 1999

Wyniki wyszukiwania

On the completeness of decomposable properties of graphs