On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On decomposing a hypergraph into \(k\) connected sub-hypergraphs |
scientific article; zbMATH DE number 1992936
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On decomposing a hypergraph into \(k\) connected sub-hypergraphs |
scientific article; zbMATH DE number 1992936 |
Statements
On decomposing a hypergraph into \(k\) connected sub-hypergraphs (English)
0 references
14 October 2003
0 references
matroid partition theorem
0 references
graphic matroids
0 references
disjoint trees theorem
0 references
edge-connected hypergraph
0 references
Steiner trees
0 references
0.92521906
0 references
0.91458833
0 references
0.90688527
0 references
0.90048295
0 references
0.89778435
0 references
0.8968425
0 references
