1,不是首尾相連called Euler path. 2,I think we can only get bound for big N. 3,For Complete Graph we can get Halmilton path easily.