Finding Hamiltonian cycles: An algorithm
Dirac's famous theorems states that If G is a graph of order () 3 such that the minimum degree (), then G is Hamiltonian. This paper presents a constructive proff of this theorem based on the C++ algorithm that finds a Hamiltonian cycle given the same conditions as the theorem. In addition, the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2008
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/5054 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |