|
In this work extensions and variations of the notion of edge-connectivity of undirected graphs, directed graphs, and hypergraphs will be considered. We show how classical results concerning orientations and connectivity augmentations may be formulated in this more general setting.
Bibtex entry:
| AUTHOR | = | {Frank, Andr{\'a}s}, |
| TITLE | = | {Edge-connection of graphs, digraphs, and hypergraphs}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2001}, |
| NUMBER | = | {TR-2001-11} |