Abstract
The purpose of this chapter is to discuss various aspects of orientations of (multi)graphs. There are many ways of looking at such questions. We can ask which graphs can be oriented as a digraph of a certain type (e.g., a locally semicomplete digraph). We can try to obtain orientations containing no directed cycles of even length, or no long paths. We can try to relate certain parameters of a graph to the family of all orientations of this graph (e.g., what does high chromatic number imply for orientations of a graph). We can also look for conditions which guarantee orientations with high arc-strong connectivity or high in-degree at every vertex, etc. There are hundreds of papers dealing with orientations of graphs in one way or another and we can only cover some of these topics. Hence we have chosen some of those mentioned above. Finally, we also study briefly the theory of submodular flows, which generalizes standard flows in networks and turns out to be a very useful tool (not only theoretically, but also algorithmically) for certain types of connectivity questions as well as orientation problems. We illustrate this by applying the submodular flow techniques to questions about orientations of mixed graphs and by giving a short proof of Nash-Williams’ orientation theorem. In Section 13.1 we also use submodular flows to give an algorithmic proof of the Lucchesi-Younger Theorem.
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). Orientations of Graphs and Digraphs. In: Digraphs. Springer Monographs in Mathematics. Springer, London. https://doi.org/10.1007/978-1-84800-998-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-84800-998-1_11
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)