- Tytuł:
- Recursively arbitrarily vertex-decomposable graphs
- Autorzy:
-
Baudon, O.
Gilbert, F.
Woźniak, M. - Powiązania:
- https://bibliotekanauki.pl/articles/255981.pdf
- Data publikacji:
- 2012
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
arbitrary vertex decomposable (AVD) graph
recursively AVD graphs - Opis:
- A graph G = (V, E) is arbitrarily vertex decomposable if for any sequence ϒ of positive integers adding up to/V/, there is a sequence of vertex-disjoint subsets of V whose orders are given by ϒ, and which induce connected graphs. The main aim of this paper is to study the recursive version of this problem. We present a solution for trees, suns, and partially for a class of 2-connected graphs called balloons.
- Źródło:
-
Opuscula Mathematica; 2012, 32, 4; 689-706
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł