Digraphs

1. Front Matter

   Pages i-xxii

   PDF

2. Basic Terminology, Notation and Results

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 1-44

3. Distances

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 45-93

4. Flows in Networks

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 95-170

5. Classes of Digraphs

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 171-226

6. Hamiltonicity and Related Problems

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 227-280

7. Hamiltonian Refinements

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 281-343

8. Global Connectivity

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 345-414

9. Orientations of Graphs

   • Jørgen Bang-Jensen, Gregory Gutin

   Pages 415-473

10. Disjoint Paths and Trees

    • Jørgen Bang-Jensen, Gregory Gutin

    Pages 475-544

11. Cycle Structure of Digraphs

    • Jørgen Bang-Jensen, Gregory Gutin

    Pages 545-590

12. Generalizations of Digraphs

    • Jørgen Bang-Jensen, Gregory Gutin

    Pages 591-638

13. Additional Topics

    • Jørgen Bang-Jensen, Gregory Gutin

    Pages 639-682

14. Back Matter

    Pages 683-754

    PDF

Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to prac­ tical problems. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been discovered over the last couple of decades. The theory of graphs can be roughly partitioned into two branches: the areas of undirected graphs and directed graphs (digraphs). Even though both areas have numerous important applications, for various reasons, undirected graphs have been studied much more extensively than directed graphs. One of the reasons is that undirected graphs form in a sense a special class of directed graphs (symmetric digraphs) and hence problems that can be for­ mulated for both directed and undirected graphs are often easier for the latter. Another reason is that, unlike for the case of undirected graphs, for which there are several important books covering both classical and recent results, no previous book covers more than a small fraction of the results obtained on digraphs within the last 25 years. Typically, digraphs are consid­ ered only in one chapter or by a few elementary results scattered throughout the book. Despite all this, the theory of directed graphs has developed enormously within the last three decades. There is an extensive literature on digraphs (more than 3000 papers). Many of these papers contain, not only interesting theoretical results, but also important algorithms as well as applications.

• Applications
• Directed Graphs
• Notation
• Theory
• algorithms
• diagraphs
• flows and connectivity
• graph
• graph algorithm
• graph algorithms
• graph theory
• hamiltonicity
• linear optimization
• mathematics
• paths and cycles
• combinatorics
• algorithm analysis and problem 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 für Mathematik, Vol. 141 (1), 2004)

"“This is a very comprehensive volume on directed graphs and related topics… [an] impressive, well-conceived, and well-written book...it is an excellent reference…[useful] for a series of seminars, where each student would be responsible for presenting a part of the material, including proofs that are in the book and proofs that are not in the book…unlike in a large number of research monographs, the authors do an excellent job putting their topic into context. Hence the book will be useful not just for researchers focusing on digraphs, but also for everyone else for whom digraphs are tools, and not goals…

Last, but not least, an extensive list of conjectures and open questions is included in every chapter. These are typically very well presented and easy to understand. I am not taking a big risk when I predict that with the help of books like this, the area will continue to progress at a fast pace.”(Miklós Bóna, MAA Online )

• Department of Mathematics and Computer Science, SDU Odense University, Odense M, Denmark

  Jørgen Bang-Jensen

• Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK

  Gregory Gutin

Policies and ethics