On decomposing a hypergraph into k connected sub-hypergraphs

Discrete Applied Mathematics

Volumn 131, Issue 2, 2003, Pages 373-383

  Frank, András ^a,b   Király, Tamás ^a   Kriesell, Matthias ^c  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b ERICSSON RESEARCH   (Hungary)

^c LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; SET THEORY;

GENERALIZATIONS;

TREES (MATHEMATICS);

EID: 0042329697     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00463-8     Document Type: Conference Paper

References (7)

1. Edmonds J. Minimum partition of a matroid into independent sets. J. Res. Nat. Bur. Standards Sect. B. 69:1965;67-72.
2. Edmonds J. Submodular functions, matroids, and certain polyhedra. Guy R., Hanani H., Sauer N., Schönheim J. Combinatorial Structures and their Applications. 1970;69-87 Gordon and Breach, New York.
3. Lorea M. Hypergraphes et matroides. Cahiers Centre Etudes Rech. Oper. 17:1975;289-291.
4. Lovász L. A generalization of Konig's theorem. Acta. Math. Acad. Sci. Hungar. 21:1970;443-446.
5. Mader W. A reduction method for edge-connectivity in graphs. Ann. Discrete Math. 3:1978;145-164.
6. Nash-Williams C.St.J.A. Decomposition of finite graphs into forests. J. London Math. Soc. 39:1964;12.
7. Tutte W.T. On the problem of decomposing a graph into. n connected factors J. London Math. Soc. 36:1961;221-230.