Hamiltonian Paths in Two Classes of Grid Graphs

Details Hamiltonian Paths in Two Classes of Grid Graphs Hamiltonian Paths in Two Classes of Grid Graphs

2011-07-09

arxiv.org/abs/1107.1780v1

Computer Science

Data Structures and Algorithms

11pages, 7figures

Scientific paper

In this paper, we give the necessary and sufficient conditions for the
existence of Hamiltonian paths in $L-$alphabet and $C-$alphabet grid graphs. We
also present a linear-time algorithm for finding Hamiltonian paths in these
graphs.

Affiliated with

Also associated with

No associations

Rating

Hamiltonian Paths in Two Classes of Grid Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamiltonian Paths in Two Classes of Grid Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamiltonian Paths in Two Classes of Grid Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-675190