Skip to Main content Skip to Navigation
Journal articles

Partitioning Harary graphs into connected subgraphs containing prescribed vertices

Abstract : A graph G is arbitrarily partitionable (AP for short) if for every partition (n_1, n_2, ..., n_p) of |V(G)| there exists a partition (V_1, V_2, ..., V_p) of V(G) such that each V_i induces a connected subgraph of G with order n_i. If, additionally, k of these subgraphs (k <= p) each contains an arbitrary vertex of G prescribed beforehand, then G is arbitrarily partitionable under k prescriptions (AP+k for short). Every AP+k graph on n vertices is (k+1)-connected, and thus has at least ceil(n(k+1)/2) edges. We show that there exist AP+k graphs on n vertices and ceil(n(k+1)/2) edges for every k >= 1 and n >= k.
Document type :
Journal articles
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Julien Bensmail <>
Submitted on : Monday, October 28, 2019 - 11:55:11 AM
Last modification on : Wednesday, September 9, 2020 - 2:42:31 PM
Long-term archiving on: : Wednesday, January 29, 2020 - 3:10:27 PM


Publisher files allowed on an open archive


  • HAL Id : hal-00687607, version 7



Olivier Baudon, Julien Bensmail, Eric Sopena. Partitioning Harary graphs into connected subgraphs containing prescribed vertices. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, 16 (3), pp.263-278. ⟨hal-00687607v7⟩



Record views


Files downloads