Edge-connectivity of undirected and directed hypergraphs
Edge-connectivity of undirected and directed hypergraphs
Edge-connectivity of undirected and directed hypergraphs
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Bibliography 135<br />
[53] M. Kriesell, Local spanning trees in graphs <strong>and</strong> hypergraph decomposition with respect<br />
to edge-<strong>connectivity</strong>, Report 257 University <strong>of</strong> Hannover (1999), Submitted for publi-<br />
cation.<br />
[54] M. Lorea, Hypergraphes et matroides, Cahiers Centre Etud. Rech. Oper. 17 (1975),<br />
289–291.<br />
[55] L. Lovász, Combinatorial Problems <strong>and</strong> Exercises, North-Holl<strong>and</strong> (1979).<br />
[56] L. Lovász, A generalization <strong>of</strong> Kőnig’s theorem, Acta. Math. Acad. Sci. Hungar. 21<br />
(1970), 443–446.<br />
[57] L. Lovász, Flats in matroids <strong>and</strong> geometric graphs, in: Combinatorial Surveys, Pro-<br />
ceedings <strong>of</strong> the 6th British Combinatorial Conference, Academic Press, London, 1977,<br />
45–86.<br />
[58] W. Mader, A reduction method for edge-<strong>connectivity</strong> in graphs, Ann. Discrete Math.<br />
3 (1978), 145–164.<br />
[59] W. Mader, Konstruktion aller n-fach kantenzusammenhängenden Digraphen, Europ.<br />
J. Combinatorics 3 (1982), 63–67.<br />
[60] H. Nagamochi, P. Eades, <strong>Edge</strong>-splitting <strong>and</strong> edge-<strong>connectivity</strong> augmentation in planar<br />
graphs, IPCO IV Springer LNCS 1412, R.E. Bixby et al, eds. (1998), 96–111.<br />
[61] C.St.J.A. Nash-Williams, On orientations, <strong>connectivity</strong> <strong>and</strong> odd vertex pairings in<br />
finite graphs, Canad. J. Math. 12 (1960), 555–567.<br />
[62] C.St.J.A Nash-Williams, Well-balanced orientations <strong>of</strong> finite graphs <strong>and</strong> unobtrusive<br />
odd-vertex pairings, in: Recent Progress in Combinatorics (ed. W.T. Tutte), Academic<br />
Press (1969), 133–149.<br />
[63] C.St.J.A. Nash-Williams, Decomposition <strong>of</strong> finite graphs into forests, J. London Math.<br />
Soc. 39 (1964), 12.<br />
[64] J. Plesnik, Minimum block containing a given graph, Archiv der mathematik Vol.<br />
XXVII (1976), 668–672.<br />
[65] H. E. Robbins, A theorem on graphs with an application to a problem <strong>of</strong> traffic control,<br />
American Math. Monthly 46 (1939), 281–283.