New Sufficient Conditions for Hamiltonian Paths

A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.

Saved in:
Bibliographic Details
Published in:TheScientificWorld 2014-01, Vol.2014 (2014), p.1-6
Main Authors: Rahman, M. Sohel, Firoz, Jesun Sahariar, Kaykobad, M.
Format: Article
Language:English
Subjects:
Economic models
Existence theorems
Graph theory
Graphs
Hamiltonian systems
Heuristic
Mathematical research
Traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.
ISSN:2356-6140
1537-744X
1537-744X
DOI:10.1155/2014/743431