On the hamiltonicity problem of bicirculants: a reduction to cyclic Haar graphs
Simona Bonvicini, Toma\v{z} Pisanski, Arjana \v{Z}itnik

TL;DR
This paper investigates the hamiltonicity of bicirculant graphs, reducing the problem to cyclic Haar graphs, and verifies a conjecture about non-hamiltonian bicirculants for various parameters.
Contribution
It proves the conjecture for bicirculants with specific set sizes and conditions, and links hamiltonicity in cyclic Haar graphs to bicirculants.
Findings
Confirmed the conjecture for bicirculants with |S| ≤ 3.
Established hamiltonicity for certain bicirculants with |S| ≥ 4 and specific m/gcd conditions.
Connected hamiltonicity in cyclic Haar graphs to bicirculant graphs.
Abstract
A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer and sets such that , , and , the graph has vertex set and edge set Bicirculant graphs with are known as cyclic Haar graphs. In 2025 we conjectured that the only non-hamiltonian graphs among regular connected bicirculants of degree more than one are the generalized Petersen graphs with . Recently we have verified the conjecture for bicirculants with and for bicirculants with odd.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
