Structure of Arbitrarily Partitionable Graphs with cutset of size k
Résumé
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]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|