Structural properties of recursively partitionable graphs with connectivity 2 - Archive ouverte HAL Access content directly
Journal Articles Discussiones Mathematicae Graph Theory Year : 2017

Structural properties of recursively partitionable graphs with connectivity 2

Abstract

A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition ($n_1, ..., n_p$) of |V(G)| there exists a partition ($V_1, ..., V_p$) of V(G) such that each V_i induces a connected subgraph of G on $n_i$ vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition of G must not only be connected but also fulfil additional conditions. In this paper, we point out some structural properties of OL-AP and R-AP graphs with connectivity 2. In particular, we show that deleting a cut pair of these graphs results in a graph with a bounded number of components, some of whom have a small number of vertices. We obtain these results by studying a simple class of 2-connected graphs called balloons.
Fichier principal
Vignette du fichier
bbfp12-orbit.pdf (370.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00672505 , version 1 (21-02-2012)
hal-00672505 , version 2 (25-04-2012)
hal-00672505 , version 3 (19-12-2012)
hal-00672505 , version 4 (07-11-2017)

Identifiers

Cite

Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak. Structural properties of recursively partitionable graphs with connectivity 2. Discussiones Mathematicae Graph Theory, 2017, 37, pp.89-115. ⟨10.7151/dmgt.1925⟩. ⟨hal-00672505v4⟩
396 View
392 Download

Altmetric

Share

Gmail Facebook X LinkedIn More