Abstract
The concept of connectivity is one of the most fundamental concepts in (directed) graph theory. There are numerous practical problems which can be formulated as (local) connectivity problems for digraphs and hence a significant part of this theory is also important from a practical point of view. Results on connectivity are often quite difficult and a deep insight may be required before one can obtain results in the area. Because of the very large number of important results on connectivity, we will devote this chapter as well as Chapters 10, 11, 12 and 14 to this area. Several connectivity problems, such as the connectivity augmentation problems in Sections 14.2 and 14.3, are of significant practical interest. These chapters illustrate several important topics as well as techniques that have been successful in solving local or global connectivity problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag London Limited
About this chapter
Cite this chapter
Bang-Jensen, J., Gutin, G.Z. (2009). Connectivity of Digraphs. In: Digraphs. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-84800-998-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-84800-998-1_5
Publisher Name: Springer, London
Print ISBN: 978-0-85729-041-0
Online ISBN: 978-1-84800-998-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)