Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph

DOI10.1016/J.ENDM.2009.07.029MaRDI QIDQ2851459zbMATH OpenFDO

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

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ENDM.2009.07.029

zbMATH Keywords

edge-connectivity augmentationhypergraphspartition constraints

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Edge-augmentation of hypergraphs
• Edge-Connectivity Augmentation with Partition Constraints
• Augmenting and preserving partition connectivity of a hypergraph
• Augmenting hypergraphs by edges of size two

Cites work

• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmenting hypergraphs by edges of size two
• Edge-connectivity augmentation problems
• Edge-Connectivity Augmentation with Partition Constraints
• Edge-connectivity augmentations of~graphs~and~hypergraphs

Cited in

(8)

• Augmenting hypergraphs by edges of size two
• Edge splitting and connectivity augmentation in directed hypergraphs.
• Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
• k-edge and 3-vertex connectivity augmentation in an arbitrary multigraph
• Edge-connectivity of permutation hypergraphs
• Augmenting and preserving partition connectivity of a hypergraph
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Local edge-connectivity augmentation in hypergraphs is NP-complete

This page was built for publication: Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851459)