In this chapter we will consider the hamiltonian path and cycle problems for digraphs as well as some related problems such as the longest path and cycle problems and the minimum path factor problem. We describe and prove a number of results in the area as well as formulate several open questions.
KeywordsNash Berman Lewin Cardi
Unable to display preview. Download preview PDF.