From the reviews: "Digraphs (directed graphs) are a long-standing and important field of graph theory. Nevertheless, this is the first comprehensive monograph devoted to the subject. As a handbook, it addresses various groups of readers (students as well as researchers, and from various areas of applications). Throughout, because of their importance for applications, emphasis is on algorithms (in form of constructive proofs whenever possible). ... a valuable and indispensable reference for many years to come. Readers and users will be thankful!" (P. Schmitt, Monatshefte fur Mathematik, Vol. 141 (1), 2004) From the reviews of the second edition: "This is a very comprehensive volume on directed graphs and related topics. ... an excellent reference. ... the book will be useful not just for researchers focusing on digraphs, but also for everyone ... . an extensive list of conjectures and open questions is included in every chapter. These are typically very well presented and easy to understand." (Miklos Bona, MAA Online, February, 2009) "The first edition of this book was published in 2000 ... . The area has continued to develop and this reorganized and updated edition contains an additional six chapters ... . there is a strong emphasis on algorithms, and constructive proofs are given whenever possible. There are more than 650 exercises and 150 open problems and conjectures. ... the bibliography contains 934 items and the author index contains 740 names. This book would be a valuable resource for anyone interested in digraphs and their applications." (J. W. Moon, Zentralblatt MATH, Vol. 1170, 2009)

• Basic Terminology, Notation and Results.- Classes of Digraphs.- Distances.- Flows in Networks.- Connectivity of Digraphs.- Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles.- Restricted Hamiltonian Paths and Cycles.- Paths and Cycles of Prescribed Lengths.- Branchings.- Linkages in Digraphs.- Orientations of Graphs and Digraphs.- Sparse Subdigraphs with Prescribed Connectivity.- Packings, Coverings and Decompositions.- Increasing Connectivity.- Feedback Sets and Vertex Orderings.- Generalizations of Digraphs: Edge-Coloured Multigraphs.- Applications of Digraphs and Edge-Coloured Graphs.- Algorithms and Their Complexity.

From the reviews: "Digraphs (directed graphs) are a long-standing and important field of graph theory. Nevertheless, this is the first comprehensive monograph devoted to the subject. As a handbook, it addresses various groups of readers (students as well as researchers, and from various areas of applications). Throughout, because of their importance for applications, emphasis is on algorithms (in form of constructive proofs whenever possible). ... a valuable and indispensable reference for many years to come. Readers and users will be thankful!" (P. Schmitt, Monatshefte fur Mathematik, Vol. 141 (1), 2004) From the reviews of the second edition: "This is a very comprehensive volume on directed graphs and related topics. ... an excellent reference. ... the book will be useful not just for researchers focusing on digraphs, but also for everyone ... . an extensive list of conjectures and open questions is included in every chapter. These are typically very well presented and easy to understand." (Miklos Bona, MAA Online, February, 2009) "The first edition of this book was published in 2000 ... . The area has continued to develop and this reorganized and updated edition contains an additional six chapters ... . there is a strong emphasis on algorithms, and constructive proofs are given whenever possible. There are more than 650 exercises and 150 open problems and conjectures. ... the bibliography contains 934 items and the author index contains 740 names. This book would be a valuable resource for anyone interested in digraphs and their applications." (J. W. Moon, Zentralblatt MATH, Vol. 1170, 2009)

• Basic Terminology, Notation and Results.- Classes of Digraphs.- Distances.- Flows in Networks.- Connectivity of Digraphs.- Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles.- Restricted Hamiltonian Paths and Cycles.- Paths and Cycles of Prescribed Lengths.- Branchings.- Linkages in Digraphs.- Orientations of Graphs and Digraphs.- Sparse Subdigraphs with Prescribed Connectivity.- Packings, Coverings and Decompositions.- Increasing Connectivity.- Feedback Sets and Vertex Orderings.- Generalizations of Digraphs: Edge-Coloured Multigraphs.- Applications of Digraphs and Edge-Coloured Graphs.- Algorithms and Their Complexity.

From the reviews: "Digraphs (directed graphs) are a long-standing and important field of graph theory. Nevertheless, this is the first comprehensive monograph devoted to the subject. As a handbook, it addresses various groups of readers (students as well as researchers, and from various areas of applications). Throughout, because of their importance for applications, emphasis is on algorithms (in form of constructive proofs whenever possible). ... a valuable and indispensable reference for many years to come. Readers and users will be thankful!" (P. Schmitt, Monatshefte fur Mathematik, Vol. 141 (1), 2004) From the reviews of the second edition: "This is a very comprehensive volume on directed graphs and related topics. ... an excellent reference. ... the book will be useful not just for researchers focusing on digraphs, but also for everyone ... . an extensive list of conjectures and open questions is included in every chapter. These are typically very well presented and easy to understand." (Miklos Bona, MAA Online, February, 2009) "The first edition of this book was published in 2000 ... . The area has continued to develop and this reorganized and updated edition contains an additional six chapters ... . there is a strong emphasis on algorithms, and constructive proofs are given whenever possible. There are more than 650 exercises and 150 open problems and conjectures. ... the bibliography contains 934 items and the author index contains 740 names. This book would be a valuable resource for anyone interested in digraphs and their applications." (J. W. Moon, Zentralblatt MATH, Vol. 1170, 2009)

• Basic Terminology, Notation and Results.- Classes of Digraphs.- Distances.- Flows in Networks.- Connectivity of Digraphs.- Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles.- Restricted Hamiltonian Paths and Cycles.- Paths and Cycles of Prescribed Lengths.- Branchings.- Linkages in Digraphs.- Orientations of Graphs and Digraphs.- Sparse Subdigraphs with Prescribed Connectivity.- Packings, Coverings and Decompositions.- Increasing Connectivity.- Feedback Sets and Vertex Orderings.- Generalizations of Digraphs: Edge-Coloured Multigraphs.- Applications of Digraphs and Edge-Coloured Graphs.- Algorithms and Their Complexity.