Digraphs pp 227-280 | Cite as

Hamiltonicity and Related Problems

  • Jørgen Bang-Jensen
  • Gregory Gutin


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.


Hamiltonian Cycle Longe Path Hamiltonian Path Oriented Graph Longe Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2002

Authors and Affiliations

  • Jørgen Bang-Jensen
    • 1
  • Gregory Gutin
    • 2
  1. 1.Department of Mathematics and Computer ScienceSDU Odense UniversityOdense MDenmark
  2. 2.Department of Computer Science, Royal HollowayUniversity of LondonEgham, SurreyUK

Personalised recommendations