On the girth and connectivity of cubic graphs with a unique longest cycle

We show that there exists an infinite family of cubic 2-connected non-hamiltonian graphs with girth 5 containing a unique longest cycle.

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 348; no. 12; p. 114702
Main Authors Jooken, Jorik, Zamfirescu, Carol T.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.12.2025
Subjects
Connectivity
Girth
Longest cycle
Connectivity
Girth
Longest cycle
Online AccessGet full text

Cover

More Information
Summary:We show that there exists an infinite family of cubic 2-connected non-hamiltonian graphs with girth 5 containing a unique longest cycle.
ISSN:0012-365X
DOI:10.1016/j.disc.2025.114702