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: | Macapagal, Rachel R., Tan, Mary Jane T. |
---|---|
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 |
Similar Items
-
A computer based approach in determining the Hamiltonian cycle of a graph
by: Dimapilis, Anna Carina V., et al.
Published: (1993) -
On degree sums, k-factors, and Hamiltonian cycles in graphs
by: Hernandez, Alana Margarita R.
Published: (2002) -
On a note on Hamilton graphs
by: Balisi, Richard Angelo, et al.
Published: (2008) -
On 2-factor hamiltonian regular bipartite graphs
by: Ku, C.Y., et al.
Published: (2014) -
On generalized fibonacci cubes which contain Hamiltonian paths
by: Mustard, Elaine M.
Published: (1998)