Cubic graphs with circumference ratio 21/22 and cyclic connectivity 5
We construct a cyclically $5$-connected cubic graph of order $22m$ and circumference $21m$ for every $m\geq 3$. Consequently, the shortness coefficient of the class of cyclically $5$-connected cubic graphs is at most $21/22$, improving the previously known upper bound of $24/25$. We also demonstrate how I-reductions, which delete an edge and suppress its two end-vertices, can be used to prove cyclic connectivity.
Authors
- Ján Mazák (ORCID: https://orcid.org/0000-0002-6498-9984)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-17
- DOI
- https://doi.org/10.48550/arxiv.2611.22037
- Primary Topic
- Advanced Graph Theory Research
- Type
- preprint