On decomposing a hypergraph into \(k\) connected sub-hypergraphs

DOI10.1016/S0166-218X(02)00463-8zbMath1022.05053MaRDI QIDQ1410689

András Frank, Tamás Király, Matthias Kriesell

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

graphic matroidsSteiner treesdisjoint trees theoremedge-connected hypergraphmatroid partition theorem

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (28)

Packing Steiner trees ⋮ Hardness and approximation results for packing Steiner trees ⋮ Packing Steiner trees with identical terminal sets ⋮ Minimum Cuts and Sparsification in Hypergraphs ⋮ Reachability in arborescence packings ⋮ Edge-partitioning 3-edge-connected graphs into paths ⋮ A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs ⋮ Steiner connectivity problems in hypergraphs ⋮ On hamiltonian line graphs of hypergraphs ⋮ Hamilton cycles in 5-connected line graphs ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Connectivity spaces ⋮ A Survey on Covering Supermodular Functions ⋮ Edge-disjoint Steiner trees and connectors in graphs ⋮ Spanning trees: A survey ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ Steiner tree packing number and tree connectivity ⋮ Packing the Steiner trees of a graph ⋮ On derivable trees ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Packing of mixed hyperarborescences with flexible roots via matroid intersection ⋮ Packing of Steiner trees and \(S\)-connectors in graphs ⋮ Edge disjoint Steiner trees in graphs without large bridges ⋮ Sparse hypergraphs and pebble game algorithms ⋮ Hamilton cycles in 6-connected claw-free graphs (Extended abstract) ⋮ On some algorithmic aspects of hypergraphic matroids

Cites Work

• On the Problem of Decomposing a Graph into n Connected Factors
• A Reduction Method for Edge-Connectivity in Graphs
• Minimum partition of a matroid into independent subsets
• A generalization of Kónig's theorem
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item

This page was built for publication: On decomposing a hypergraph into \(k\) connected sub-hypergraphs