Sciweavers

77
Voted
TCS
2010
14 years 7 months ago
A comprehensive analysis of degree based condition for Hamiltonian cycles
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
Md. Kamrul Hasan, Mohammad Kaykobad, Young-Koo Lee...