Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph

DOI10.1002/JGT.21643zbMath1261.05050OpenAlexW1521743927MaRDI QIDQ4916091

Zoltán Szigeti, Roland Grappe, Attila Bernáth

Publication date: 19 April 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21643

zbMATH Keywords

hypergraphsedge-connectivity augmentationpartition constraints

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (4)

Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph ⋮ Sufficient conditions for maximally edge-connected hypergraphs ⋮ The \((2, k)\)-connectivity augmentation problem: algorithmic aspects ⋮ Edge-connectivity in hypergraphs

Cites Work

• Unnamed Item
• Edge-connectivity of permutation hypergraphs
• Local edge-connectivity augmentation in hypergraphs is NP-complete
• Edge-connectivity augmentation problems
• On a theorem of Mader
• Augmenting hypergraphs by edges of size two
• Covering symmetric supermodular functions by graphs
• Distance and connectivity measures in permutation graphs
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Edge-Connectivity Augmentations of Graphs and Hypergraphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• A Reduction Method for Edge-Connectivity in Graphs
• Edge-Connectivity Augmentation with Partition Constraints
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

This page was built for publication: Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph