Create README.md

sandeepsj · sandeepsj · commit e069fcd0e57a · 2019-06-03T19:43:16.000+05:30
diff --git a/Backtracking/Hamiltonean Cycles/README.md b/Backtracking/Hamiltonean Cycles/README.md
@@ -0,0 +1,5 @@
+# Hamiltonean Cycles
+A **Hamiltonean Path** is a path in an undirected or directed graph that visits each vertex exactly once. A **Hamiltonian cycle** (or Hamiltonian circuit) is a Hamiltonian path that is a cycle. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete. 
+
+## References
+-[Wikipedia](https://en.wikipedia.org/wiki/Hamiltonian_path)
