Structure of Arbitrarily Partitionable Graphs with cutset of size k - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2012

Structure of Arbitrarily Partitionable Graphs with cutset of size k

Abstract

A graph G = (V,E) is arbitrarily partitionable 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 subgraphs. In this paper, we focus on the number and the sizes of the components of an arbitrarily partitionable graph after removing a cutset.
Fichier principal
Vignette du fichier
k-connected.pdf (296.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00690253 , version 1 (22-04-2012)
hal-00690253 , version 2 (27-04-2012)
hal-00690253 , version 3 (30-04-2012)
hal-00690253 , version 4 (09-05-2012)
hal-00690253 , version 5 (25-05-2012)
hal-00690253 , version 6 (29-06-2012)
hal-00690253 , version 7 (20-09-2012)
hal-00690253 , version 8 (24-04-2013)
hal-00690253 , version 9 (26-04-2013)

Identifiers

  • HAL Id : hal-00690253 , version 4

Cite

Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Woźniak. Structure of Arbitrarily Partitionable Graphs with cutset of size k. 2012. ⟨hal-00690253v4⟩
127 View
192 Download

Share

Gmail Facebook X LinkedIn More