Recursively arbitrarily vertex-decomposable graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Opuscula Mathematica Année : 2012

Recursively arbitrarily vertex-decomposable graphs

Résumé

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.

Dates et versions

hal-00918939 , version 1 (16-12-2013)

Identifiants

Citer

Olivier Baudon, Frédéric Gilbert, Mariusz Woźniak. Recursively arbitrarily vertex-decomposable graphs. Opuscula Mathematica, 2012, 32 (4), pp.689-706. ⟨10.7494/OpMath.2012.32.4.689⟩. ⟨hal-00918939⟩
71 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More