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

Jorik Jooken; Carol T Zamfirescu

doi:10.1016/j.disc.2025.114702

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

Jorik Jooken
, Carol T Zamfirescu

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Article number	114702
Number of pages	4
Journal	Discrete Mathematics
Volume	348
Issue number	12
DOIs	https://doi.org/10.1016/j.disc.2025.114702
Publication status	Published - Dec 2025
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2025 Elsevier B.V.

Access to Document

10.1016/j.disc.2025.114702

Cite this

@article{af52033e5b044aca8e96ac9d1399cd6a,

title = "On the girth and connectivity of cubic graphs with a unique longest cycle",

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

author = "Jorik Jooken and Zamfirescu, \{Carol T\}",

note = "Publisher Copyright: {\textcopyright} 2025 Elsevier B.V.",

year = "2025",

month = dec,

doi = "10.1016/j.disc.2025.114702",

language = "English",

volume = "348",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "12",

}

TY - JOUR

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

AU - Jooken, Jorik

AU - Zamfirescu, Carol T

PY - 2025/12

Y1 - 2025/12

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

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

UR - https://go.openathens.net/redirector/westernsydney.edu.au?url=https://doi.org/10.1016/j.disc.2025.114702

U2 - 10.1016/j.disc.2025.114702

DO - 10.1016/j.disc.2025.114702

M3 - Article

SN - 0012-365X

VL - 348

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 12

M1 - 114702

ER -

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

Abstract

Bibliographical note

Access to Document

Other files and links

Cite this