On the girth and connectivity of cubic graphs with a unique longest cycle
Combinatorics
2025-07-31 v2
Abstract
We show that there exists an infinite family of cubic -connected non-hamiltonian graphs with girth containing a unique longest cycle.
Cite
@article{arxiv.2409.17205,
title = {On the girth and connectivity of cubic graphs with a unique longest cycle},
author = {Jorik Jooken and Carol T. Zamfirescu},
journal= {arXiv preprint arXiv:2409.17205},
year = {2025}
}