@Article{Baudon2011,
author = "Baudon, Olivier and Gilbert, Frédéric and Woźniak, Mariusz",
title = "Recursively arbitrarily vertex-decomposable suns",
journal = "Opuscula Math.",
year = "2011",
volume = "31",
number = "4",
pages = "533--547",
doi = "http://dx.doi.org/10.7494/OpMath.2011.31.4.533",
url = "http://dx.doi.org/10.7494/OpMath.2011.31.4.533",
abstract = "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].",
keywords = "arbitrarily vertex-decomposable graphs (AVD), recursively AVD graphs",
issn = "1232-9274"
}