Szczegóły publikacji
Opis bibliograficzny
Arbitrarily vertex decomposable caterpillars with four or five leaves / Sylwia CICHACZ, Agnieszka GÖRLICH, Antoni MARCZYK, Jakub PRZYBYŁO, Mariusz WOŹNIAK // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2006 — vol. 26 no. 2, s. 291–305. — Bibliogr. s. 305, Abstr. — M. Woźniak - pierwsza afiliacja: Institute of Mathematics of Polish Academy of Sciences. — 13th Workshop '3in1' GRAPHS 2004 : Krynica, November 11–13, 2004. — Zielona Góra : Technical University Press, 2006
Autorzy (5)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 30768 |
|---|---|
| Data dodania do BaDAP | 2006-12-28 |
| Tekst źródłowy | URL |
| Rok publikacji | 2006 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discussiones Mathematicae, Graph Theory |
Abstract
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a1, . . . , ak) of positive integers such that a1+. . .+ak = n there exists a partition (V1, . . . , Vk) of the vertex set of G such that for each i ∈ {1, . . . , k}, Vi induces a connected subgraph of G on ai vertices. D. Barth and H. Fournier showed that if a tree T is arbitrarily vertex decomposable, then T has maximum degree at most 4. In this paper we give a complete characterization of arbitrarily vertex decomposable caterpillars with four leaves. We also describe two families of arbitrarily vertex decomposable trees with maximum degree three or four.
