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

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

Applied Mathematics and Computation, 2021, vol. 392, issue C

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.

Keywords: Non-hamiltonian; Perihamiltonian; Hypohamiltonian (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320306676
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:392:y:2021:i:c:s0096300320306676

DOI: 10.1016/j.amc.2020.125714

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