Sufficient conditions for hypergraphs to be maximally edge-connected
From MaRDI portal
Publication:2335157
DOI10.1016/j.amc.2018.03.109zbMath1427.05153OpenAlexW2799844489MaRDI QIDQ2335157
Publication date: 13 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.03.109
Related Items (4)
The edge‐connectivity of vertex‐transitive hypergraphs ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ The reliability of lexicographic product digraphs ⋮ Connectivity of Cartesian product of hypergraphs
Cites Work
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
- Maximally edge-connected hypergraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Inverse degree and edge-connectivity
- Sufficient conditions for maximally connected dense graphs
- Edge-augmentation of hypergraphs
- Augmenting hypergraphs by edges of size two
- HYPERGRAPHS
- Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sufficient conditions for hypergraphs to be maximally edge-connected
