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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.