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

Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian

Author

Listed:
  • Fabrici, Igor
  • Madaras, Tomáš
  • Timková, Mária
  • Van Cleemput, Nico
  • Zamfirescu, Carol T.

Abstract

A graph G is perihamiltonian if G itself is non-hamiltonian, yet every edge-contracted subgraph of G is hamiltonian. These graphs form a superclass of the hypohamiltonian graphs. By applying a recent result of Wiener on path-critical graphs, we prove the existence of infinitely many perihamiltonian graphs of connectivity k for any k ≥ 2. We also show that every planar perihamiltonian graph of connectivity k contains a vertex of degree k. This strengthens a theorem of Thomassen, and entails that if in a polyhedral graph of minimum degree at least 4 the set of vertices whose removal yields a non-hamiltonian graph is independent, the graph itself must be hamiltonian. Finally, while we here prove that there are infinitely many polyhedral perihamiltonian graphs containing no adjacent cubic vertices, whether an analogous result holds for the hypohamiltonian case remains open.

Suggested Citation

  • Fabrici, Igor & Madaras, Tomáš & Timková, Mária & Van Cleemput, Nico & Zamfirescu, Carol T., 2021. "Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    • Handle: RePEc:eee:apmaco:v:392:y:2021:i:c:s0096300320306676
    DOI: 10.1016/j.amc.2020.125714
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320306676
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125714?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:392:y:2021:i:c:s0096300320306676. 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.