A graph G of order n is called arbitrarily partitionable (AP for short) if, for every sequence
(n_1,...,n_k) of positive integers with n_1+⋯+n_k=n, there exists a partition (V_1,...,V_k) of …

A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
1,..., nk) of positive integers such that n 1+···+ nk= n there exists a partition (V 1,..., V k) of the …

An arbitrarily partitionable (AP) graph is a graph that can be partitioned into arbitrarily many
connected graphs with arbitrary orders. Since independent seminal works by Barth, Baudon …

A graph G=(V, E) is arbitrarily vertex decomposable if for any sequence τ of positive integers
adding up to| V|, there is a sequence of vertex-disjoint subsets of V whose orders are given …

This thesis is dedicated to the study of two families of graph partition problems. First, we
consider the problem of vertex-partitioning a graph into connected subgraphs. Namely …

A graph G of order n is called arbitrarily vertex decomposable if for each sequence (n1,…,
nk) of positive integers with n1+⋯+ nk= n, there exists a partition (V1,…, Vk) of the vertex set …

A graph G=(V, E) of order n is said to be arbitrarily partitionable if for each sequence λ=(λ 1,
λ 2,…, λ p) of positive integers with λ 1+…+ λ p= n, there exists a partition (V 1, V 2,…, V p) of …

On the Cartesian product of an arbitrarily partitionable graph and a traceable graph Page 1
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:2, 2014, 225–232 On …

A graph G=(V, E) is arbitrarily vertex decomposable if for any sequence τ of positive integers
adding up to/V/, there is a sequence of vertex-disjoint subsets of V whose orders are given …

A graph G of order n is called arbitrarily partitionable (AP, for short) if, for every sequence (n
1,…, nk) of positive integers with n 1+…+ nk= n, there exists a partition (V 1,…, V k) of the …