IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v475y2024ics0096300324002236.html
   My bibliography  Save this article

Interplays between variations of arbitrarily partitionable graphs under minimality constraints

Author

Listed:
  • Baudon, Olivier
  • Bensmail, Julien
  • Boivin, Morgan

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

Suggested Citation

  • Baudon, Olivier & Bensmail, Julien & Boivin, Morgan, 2024. "Interplays between variations of arbitrarily partitionable graphs under minimality constraints," Applied Mathematics and Computation, Elsevier, vol. 475(C).
    • Handle: RePEc:eee:apmaco:v:475:y:2024:i:c:s0096300324002236
    DOI: 10.1016/j.amc.2024.128753
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324002236
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128753?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:475:y:2024:i:c:s0096300324002236. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.