Digraphs

Theory, Algorithms and Applications

Authors:

ISBN: 978-0-85729-041-0 (Print) 978-1-84800-998-1 (Online)

Table of contents (18 chapters)

  1. Front Matter

    Pages i-xxii

  2. No Access

    Book Chapter

    Pages 1-30

    Basic Terminology, Notation and Results

  3. No Access

    Book Chapter

    Pages 31-86

    Classes of Digraphs

  4. No Access

    Book Chapter

    Pages 87-126

    Distances

  5. No Access

    Book Chapter

    Pages 127-190

    Flows in Networks

  6. No Access

    Book Chapter

    Pages 191-226

    Connectivity of Digraphs

  7. No Access

    Book Chapter

    Pages 227-274

    Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles

  8. No Access

    Book Chapter

    Pages 275-305

    Restricted Hamiltonian Paths and Cycles

  9. No Access

    Book Chapter

    Pages 307-338

    Paths and Cycles of Prescribed Lengths

  10. No Access

    Book Chapter

    Pages 339-372

    Branchings

  11. No Access

    Book Chapter

    Pages 373-416

    Linkages in Digraphs

  12. No Access

    Book Chapter

    Pages 417-478

    Orientations of Graphs and Digraphs

  13. No Access

    Book Chapter

    Pages 479-504

    Sparse Subdigraphs with Prescribed Connectivity

  14. No Access

    Book Chapter

    Pages 505-552

    Packings, Coverings and Decompositions

  15. No Access

    Book Chapter

    Pages 553-582

    Increasing Connectivity

  16. No Access

    Book Chapter

    Pages 583-606

    Feedback Sets and Vertex Orderings

  17. No Access

    Book Chapter

    Pages 607-641

    Generalizations of Digraphs: Edge-Coloured Multigraphs

  18. No Access

    Book Chapter

    Pages 643-694

    Applications of Digraphs and Edge-Coloured Graphs

  19. No Access

    Book Chapter

    Pages 695-720

    Algorithms and Their Complexity

  20. Back Matter

    Pages 721-795