TY  - JOUR
ID  - Baudon2011
LB  - Baudon2011
AU  - Baudon, Olivier
AU  - Gilbert, Frédéric
AU  - Woźniak, Mariusz
TI  - Recursively arbitrarily vertex-decomposable suns
ST  - Recursively arbitrarily vertex-decomposable suns
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2011
VL  - 31
IS  - 4
SP  - 533
EP  - 547
DO  - http://dx.doi.org/10.7494/OpMath.2011.31.4.533
UR  - http://dx.doi.org/10.7494/OpMath.2011.31.4.533
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 aim of this paper is to study the recursive version of this problem on a special class of graphs called suns. This paper is a complement of [O. Baudon, F. Gilbert, M. Woźniak, Recursively arbitrarily vertex-decomposable graphs, research report, 2010].
KW  - arbitrarily vertex-decomposable graphs (AVD)
KW  - recursively AVD graphs
SN  - 1232-9274
ER  -