In Chapter 3, we introduced the notion of a covering of the edge set of a graph by subgraphs. One may of course consider other notions of covering, for instance covering the vertex set by subgraphs (see, for example, the extension of Theorem 18.10 noted at the end of Section 18.3). And, naturally, the same ideas apply equally well to directed graphs. The language of hypergraphs provides a convenient general setting in which to discuss these and related notions.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Rights and permissions
Copyright information
© 2008 J.A. Bondy & U.S.R. Murty
About this chapter
Cite this chapter
(2008). Coverings and Packings in Directed Graphs. In: Graph Theory. Graduate Texts in Mathematics, vol 244. Springer, London. https://doi.org/10.1007/978-1-84628-970-5_19
Download citation
DOI: https://doi.org/10.1007/978-1-84628-970-5_19
Publisher Name: Springer, London
Print ISBN: 978-1-84628-969-9
Online ISBN: 978-1-84628-970-5