A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
More aspects of arbitrarily partitionable graphs

2020
*
Discussiones Mathematicae Graph Theory
*

A graph G of order n is arbitrarily partitionable (AP) if, for every sequence (n 1 , . . . , n p ) partitioning n, there is a partition (V 1 , . . . , V p ) of V (G) such that G[V i ] is a connected n i -graph for i = 1, . . . , p. The property of being AP is related to other well-known graph notions, such as perfect matchings and Hamiltonian cycles, with which it shares several properties. This work is dedicated to studying two aspects behind AP graphs. On the one hand, we consider algorithmic

doi:10.7151/dmgt.2343
fatcat:a5uztsh2ljdhfkg6rlm5xud2cq