↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Digraphs : theory, algorithms and applications
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
Basic Terminology, Notation and Results
Altmetric Badge
Chapter 2
Classes of Digraphs
Altmetric Badge
Chapter 3
Distances
Altmetric Badge
Chapter 4
Flows in Networks
Altmetric Badge
Chapter 5
Connectivity of Digraphs
Altmetric Badge
Chapter 6
Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles
Altmetric Badge
Chapter 7
Restricted Hamiltonian Paths and Cycles
Altmetric Badge
Chapter 8
Paths and Cycles of Prescribed Lengths
Altmetric Badge
Chapter 9
Branchings
Altmetric Badge
Chapter 10
Linkages in Digraphs
Altmetric Badge
Chapter 11
Orientations of Graphs and Digraphs
Altmetric Badge
Chapter 12
Sparse Subdigraphs with Prescribed Connectivity
Altmetric Badge
Chapter 13
Packings, Coverings and Decompositions
Altmetric Badge
Chapter 14
Increasing Connectivity
Altmetric Badge
Chapter 15
Feedback Sets and Vertex Orderings
Altmetric Badge
Chapter 16
Generalizations of Digraphs: Edge-Coloured Multigraphs
Altmetric Badge
Chapter 17
Applications of Digraphs and Edge-Coloured Graphs
Altmetric Badge
Chapter 18
Algorithms and Their Complexity
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
twitter
12
X users
syllabi
3
institutions with syllabi
wikipedia
16
Wikipedia pages
Citations
dimensions_citation
719
Dimensions
Readers on
mendeley
55
Mendeley
citeulike
2
CiteULike
Book overview
1. Basic Terminology, Notation and Results
2. Classes of Digraphs
3. Distances
4. Flows in Networks
5. Connectivity of Digraphs
6. Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles
7. Restricted Hamiltonian Paths and Cycles
8. Paths and Cycles of Prescribed Lengths
9. Branchings
10. Linkages in Digraphs
11. Orientations of Graphs and Digraphs
12. Sparse Subdigraphs with Prescribed Connectivity
13. Packings, Coverings and Decompositions
14. Increasing Connectivity
15. Feedback Sets and Vertex Orderings
16. Generalizations of Digraphs: Edge-Coloured Multigraphs
17. Applications of Digraphs and Edge-Coloured Graphs
18. Algorithms and Their Complexity
Summary
X
Syllabi
Wikipedia
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
10
syllabi from
3
institutions on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Nottingham Trent University
8
Unknown
Iran University of Science and Technology Tehran
1
Engineering, Education
Unknown
1
Unknown