Sufficient conditions for maximally edge-connected hypergraphs

DOI10.1007/s40305-018-0224-4zbMath1474.05293OpenAlexW2894606657WikidataQ129139650 ScholiaQ129139650MaRDI QIDQ2033988

Lin-Ken Tong, Erfang Shan

Publication date: 18 June 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-018-0224-4

zbMATH Keywords

hypergraphedge-connectivitymaximally edge-connected hypergraph

Mathematics Subject Classification ID

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

Related Items (4)

Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ The edge‐connectivity of vertex‐transitive hypergraphs ⋮ Edge-connectivity in hypergraphs ⋮ Connectivity of Cartesian product of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-connectivity of permutation hypergraphs
• Maximally edge-connected hypergraphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Local edge-connectivity augmentation in hypergraphs is NP-complete
• Sufficient conditions for maximally connected dense graphs
• Results on the edge-connectivity of graphs
• Edge splitting and connectivity augmentation in directed hypergraphs.
• Hypergraph theory. An introduction
• Connectivity in Hypergraphs
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph
• Connection and separation in hypergraphs

This page was built for publication: Sufficient conditions for maximally edge-connected hypergraphs