Structure of Arbitrarily Partitionable Graphs with cutset of size k

Olivier Baudon (1) , Florent Foucaud (1) , Jakub Przybylo (2) , Mariusz Woźniak (2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 AGH UST - AGH University of Science and Technology [Krakow, PL]

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.

Domaines: Mathématique discrète [cs.DM]

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