Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
Bang-Jensen, J., Gutin, G. (2002). Hamiltonicity and Related Problems. In: Digraphs. Springer, London. https://doi.org/10.1007/978-1-4471-3886-0_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3886-0_5
Publisher Name: Springer, London
Print ISBN: 978-1-85233-611-0
Online ISBN: 978-1-4471-3886-0
eBook Packages: Springer Book Archive