On decomposing a hypergraph into k connected sub-hypergraphs
Authors:
- András FrankAFAndrás Frank
- Tamás KirályTKTamás Király
- Matthias KriesellMKMatthias Kriesell
- 1 September 2003
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 131 (2) , 373-383
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Reduction Method for Edge-Connectivity in Graphs1978
- A generalization of Kónig's theoremActa Mathematica Hungarica, 1970
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Decomposition of Finite Graphs Into ForestsJournal of the London Mathematical Society, 1964
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961