Question 1160738
<font face="Times New Roman" size="+2">


A connected graph is said to have a Hamiltonian circuit if it has a circuit that ‘visits’ each node (or vertex) exactly once. A graph that has a Hamiltonian circuit is called a Hamiltonian graph.
								
								
John
*[tex \LARGE e^{i\pi}\ +\ 1\ =\ 0]
My calculator said it, I believe it, that settles it
<img src="http://c0rk.blogs.com/gr0undzer0/darwin-fish.jpg">
*[tex \Large \ \
*[tex \LARGE \ \ \ \ \ \ \ \ \ \  
								
{{n}\choose{r}}
</font>