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, and Puech, and Horňák and Woźniak, AP graphs have been receiving increasing attention in the literature, dedicated to understanding several of their aspects, including structural aspects, algorithmic aspects, and their connections with Hamiltonian graphs. Other aspects of interest cover variants of AP graphs, such as AP graphs that can be partitioned in an online way (OLAP graphs), AP graphs that can be partitioned in a recursive way (RAP graphs), and AP graphs that are edge-minimal (minAP graphs).

中文翻译：

---

最小约束下任意可划分图的变化之间的相互作用


任意可划分（AP）图是可以划分为任意多个具有任意阶的连通图的图。自从 Barth、Baudon 和 Puech、Horňák 和 Woźniak 发表独立的开创性著作以来，AP 图在文献中受到越来越多的关注，致力于理解它们的几个方面，包括结构方面、算法方面以及它们与哈密顿图的联系。其他感兴趣的方面包括 AP 图的变体，例如可以以在线方式分区的 AP 图（OLAP 图）、可以以递归方式分区的 AP 图（RAP 图）以及边缘最小化的 AP 图（minAP 图）。