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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00672505
Contributor : Julien Bensmail <>
Submitted on : Tuesday, November 7, 2017 - 7:54:35 AM
Last modification on : Wednesday, November 7, 2018 - 2:36:04 PM
Document(s) archivé(s) le : Thursday, February 8, 2018 - 12:24:58 PM

File

bbfp12-orbit.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

351

Files downloads

51