6 1 Hamiltonian Circuits by T08G2Yz

VIEWS: 0 PAGES: 1

									NAMES:

                                 6.1 – Hamiltonian Circuits

         A circuit is Hamiltonian if it visits every vertex in the graph exactly once. Your problem is to
determine if each of the following graphs has a Hamiltonian Circuit. Make those determinations and
fill out the results at the bottom of the page.




Have a Hamiltonian Circuit:

Do not have a Hamiltonian Circuit:

								
To top