Structural Properties of Recursively Partitionable Graphs with Connectivity 2
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger versions of this property were introduced...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1925 |