TY  - JOUR
ID  - Baudon2012
LB  - Baudon2012
AU  - Baudon, Olivier
AU  - Gilbert, Frédéric
AU  - Woźniak, Mariusz
TI  - Recursively arbitrarily vertex-decomposable graphs
ST  - Recursively arbitrarily vertex-decomposable graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2012
VL  - 32
IS  - 4
SP  - 689
EP  - 706
DO  - http://dx.doi.org/10.7494/OpMath.2012.32.4.689
UR  - http://dx.doi.org/10.7494/OpMath.2012.32.4.689
AB  - A graph \(G = (V;E)\) is arbitrarily vertex decomposable if for any sequence \(\tau\) of positive integers adding up to \(|V|\), there is a sequence of vertex-disjoint subsets of \(V\) whose orders are given by \(\tau\), 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.
KW  - arbitrary vertex decomposable (AVD) graph
KW  - recursively AVD graphs
SN  - 1232-9274
ER  -