Edge-connectivity in hypergraphs
From MaRDI portal
Publication:2065350
DOI10.1007/s13226-021-00052-5zbMath1477.05098OpenAlexW3185050346MaRDI QIDQ2065350
Dan Li, Shuang Zhao, Ji Xiang Meng
Publication date: 7 January 2022
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-021-00052-5
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
- Edge-connectivity of permutation hypergraphs
- Maximally edge-connected hypergraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Inverse degree and edge-connectivity
- Edge-augmentation of hypergraphs
- Augmenting hypergraphs by edges of size two
- Results on the edge-connectivity of graphs
- Sufficient conditions for maximally edge-connected hypergraphs
- Lower-bounds on the connectivities of a graph
- HYPERGRAPHS
- Connectivity in Hypergraphs
- Sufficient conditions for maximally edge-connected and super-edge-connected graphs
- 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
- A Graph-Theoretic Approach to a Communications Problem
This page was built for publication: Edge-connectivity in hypergraphs
