Year: 2026
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Mazák, Ján
Institution: Comenius University Bratislava
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235995949
