On decomposing a hypergraph into \(k\) connected sub-hypergraphs
type: Item
instance of: scholarly article
title: On decomposing a hypergraph into \(k\) connected sub-hypergraphs
zbMATH Open document ID: 1022.05053
DOI: 10.1016/S0166-218X(02)00463-8
author: András Frank
author: Tamás Király
author: Matthias Kriesell
published in: Discrete Applied Mathematics
publication date: 2003-10-14T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 1992936
zbMATH Keywords: matroid partition theorem
zbMATH Keywords: graphic matroids
zbMATH Keywords: disjoint trees theorem
zbMATH Keywords: edge-connected hypergraph
zbMATH Keywords: Steiner trees
MaRDI profile type: Publication
cites work: Minimum partition of a matroid into independent subsets
cites work: Q5684698
cites work: Q4091971
cites work: A generalization of Kónig's theorem
cites work: A Reduction Method for Edge-Connectivity in Graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: On the Problem of Decomposing a Graph into n Connected Factors
Recommended article: The decomposition of graphs into \(k\)-connected components
Recommended article: Q5135787
Recommended article: Q3137219
Recommended article: Decomposing hypercubes into regular connected subgraphs
Recommended article: Q4027153
Recommended article: On decompositions of complete hypergraphs
Recommended article: Decomposition of a hypergraph by partial-edge separators
Recommended article: Decomposition of hypercubes into regular connected bipancyclic subgraphs
Recommended article: Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
Recommended article: Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
description: scientific article; zbMATH DE number 1992936