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

DOI10.1002/jgt.21643zbMath1261.05050MaRDI 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

hypergraphs; edge-connectivity augmentation; partition constraints

Mathematics Subject Classification ID

05C65: Hypergraphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C40: Connectivity

Related Items

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

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