Digraphs. Theory, algorithms and applications. 2nd ed. (English) Zbl 1170.05002

Springer Monographs in Mathematics. London: Springer (ISBN 978-1-84800-997-4/hbk; 978-1-84800-998-1/ebook). xxii, 795 p. (2009).
The first edition of this book was published in 2000 and reviewed in Zbl 0958.05002. The area has continued to develop and this reorganized and updated edition contains an additional six chapters on branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivities, packing, covering and decompositions of digraphs, and applications. As before, 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. Some idea of the comprehensiveness of the book may be gained from the fact that 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.


05-02 Research exposition (monographs, survey articles) pertaining to combinatorics
05C20 Directed graphs (digraphs), tournaments
05C40 Connectivity
05C45 Eulerian and Hamiltonian graphs
05C85 Graph algorithms (graph-theoretic aspects)


Zbl 0958.05002
Full Text: DOI