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:
| Main Authors: | M. Sohel Rahman, M. Kaykobad, Jesun Sahariar Firoz |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/743431 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Sufficient conditions for the existence of path-factors with given properties
by: Hui Qin, et al.
Published: (2025-01-01) -
Hamiltonian Paths in Some Classes of Grid Graphs
by: Fatemeh Keshavarz-Kohjerdi, et al.
Published: (2012-01-01) -
Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases
by: E. G. Andrianova, et al.
Published: (2019-08-01) -
Sufficient Conditions for Janowski Starlikeness
by: Rosihan M. Ali, et al.
Published: (2007-01-01) -
Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs
by: Amir Kalev, et al.
Published: (2025-02-01)