I have the cycle basis for an undirected simple graph obtained from the spanning tree.

Is it possible to check whether there is a Hamiltonian cycle, and if so find the sequence of edges of a(or the) Hamiltonian cycle?

New contributor
Ganapati Natarajan is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.

put on hold as off-topic by Sasho Nikolov, Aryeh, Gamow, D.W., Brout 1 hour ago

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Sasho Nikolov, Aryeh, Gamow, D.W., Brout
If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ A cycle basis can be found in polynomial time, and checking for hamiltonicity is NP-hard. $\endgroup$ – Sasho Nikolov May 15 at 18:59