| Autor: |
Axler, S., Ribet, K. A., Bondy, J. A., Murty, U. S. R. |
| Zdroj: |
Graph Theory; 2008, p503-526, 24p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
