Recursively Arbitrarily Vertex Decomposable Suns

Authors:

  • 31 August 2010
    • preprint
    • Published by HAL in HAL
Abstract
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-disjoints subsets of V whose orders are given by τ, 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 report is a complement of the paper "Recursively Arbitrarily Vertex Decomposable Graphs", submitted to Discrete Mathematics.

This publication has 3 references indexed in Scilit: