Partitioning vertices and edges of graphs into connected subgraphs

Olivier Baudon, Julien Bensmail and Lyn Vayssieres

Applied Mathematics and Computation, 2025, vol. 505, issue C

Abstract: Arbitrarily partitionable (AP) graphs are graphs that can have their vertices partitioned into arbitrarily many parts inducing connected graphs of arbitrary orders. Since their introduction, several aspects of AP graphs have been investigated in literature, including structural and algorithmic aspects, their connections with other fundamental notions of graph theory, and variants of the original notion. Quite recently, an edge version of AP graphs, called arbitrarily edge-partitionable (AEP) graphs have been introduced and studied, with a special focus on their similarities and discrepancies with AP graphs.

Keywords: Arbitrarily partitionable graph; Partition into connected graphs; Total graph (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325002577
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:505:y:2025:i:c:s0096300325002577

DOI: 10.1016/j.amc.2025.129531

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().