- Tytuł:
- On some families of arbitrarily vertex decomposable spiders
- Autorzy:
-
Juszczyk, T.
Zioło, I. A. - Powiązania:
- https://bibliotekanauki.pl/articles/254779.pdf
- Data publikacji:
- 2010
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
arbitrarily vertex decomposable graph
trees - Opis:
- A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1, . . . , nk) of positive integers such that [formula], there exists a partition (V1, . . . , Vk) of the vertex set of G such that for every i ∈ {1, . . . , k} the set Vi induces a connected subgraph of G on ni vertices. A spider is a tree with one vertex of degree at least 3. We characterize two families of arbitrarily vertex decomposable spiders which are homeomorphic to stars with at most four hanging edges.
- Źródło:
-
Opuscula Mathematica; 2010, 30, 2; 147-154
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł