3 papers
math.CO2026
On the hamiltonicity problem of bicirculants: a reduction to cyclic Haar graphs
Simona Bonvicini, Tomaž Pisanski, Arjana Žitnik
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 se…
math.CO2025
On the Hamiltonian Bicirculants
S. Bonvicini, T. Pisanski, A. Žitnik
A bicirculant is a regular graph that admits a semi-regular automorphism with two vertex-orbits of the same size. By we denote the size of vertex-orbits and by the valence…
math.CO2025
All generalized rose window graphs are hamiltonian
Simona Bonvicini, Tomaž Pisanski, Arjana Žitnik
A bicirculant is a regular, -valent graph that admits a semiregular automorphism of order having two vertex-orbits of size . The vertices of each orbit induce a circulant…