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 or vertex-heaviest path and cycle problems. 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
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this chapter
Cite this chapter
Bang-Jensen, J., Gutin, G.Z. (2009). Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles. In: Digraphs. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-84800-998-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-84800-998-1_6
Publisher Name: Springer, London
Print ISBN: 978-0-85729-041-0
Online ISBN: 978-1-84800-998-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)