Interplays between variations of arbitrarily partitionable graphs under minimality constraints

Olivier Baudon, Julien Bensmail and Morgan Boivin

Applied Mathematics and Computation, 2024, vol. 475, issue C

Abstract: 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).

Keywords: Arbitrarily partitionable graph; Partition into connected subgraphs; Online arbitrarily partitionable graph; Recursively arbitrarily partitionable graph; Minimality (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324002236
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:475:y:2024:i:c:s0096300324002236

DOI: 10.1016/j.amc.2024.128753

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 ().