The bicirculant Hamiltonicity conjecture
Statement
A bicirculant is a regular graph admitting a semiregular automorphism with two vertex-orbits of equal size; a graph is hamiltonian if it contains a Hamilton cycle. Let denote the complete graph on two vertices, and let be the generalized Petersen graph with parameters and .
Bicirculant Hamiltonicity conjecture. Every connected bicirculant, except for and the generalized Petersen graphs with , is hamiltonian.
The conjecture extends Brian Alspach’s classification of hamiltonian generalized Petersen graphs to all connected bicirculants. Hamiltonicity for bicirculants is widely open; in particular, the paper notes that it is not known whether all Cayley graphs on dihedral groups are hamiltonian.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.