Maximally edge-connected hypergraphs
From MaRDI portal
Publication:501024
DOI10.1016/J.DISC.2015.07.008zbMATH Open1322.05100OpenAlexW2195176792MaRDI QIDQ501024FDOQ501024
Authors: Peter Dankelmann, Dirk Meierling 
Publication date: 8 October 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.07.008
Recommendations
- Sufficient conditions for maximally edge-connected hypergraphs
- Edge-connectivity in hypergraphs
- Sufficient conditions for hypergraphs to be maximally edge-connected and super-edge-connected
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
- The connectivity of hypergraphs
Cites Work
- Inverse degree and edge-connectivity
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- HYPERGRAPHS
- Title not available (Why is that?)
- Edge-augmentation of hypergraphs
- Augmenting hypergraphs by edges of size two
- A Graph-Theoretic Approach to a Communications Problem
Cited In (22)
- Super Edge-Connected Linear Hypergraphs
- Title not available (Why is that?)
- Edge-connectivity in hypergraphs
- The edge‐connectivity of vertex‐transitive hypergraphs
- Title not available (Why is that?)
- Sufficient conditions for hypergraphs to be maximally edge-connected
- On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
- Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
- Connection and separation in hypergraphs
- Connectivity in hypergraphs
- Edge-connectivity of permutation hypergraphs
- Hyperconnectivity of graphs
- Sufficient conditions for maximally edge-connected hypergraphs
- Connectivity of Cartesian product of hypergraphs
- Title not available (Why is that?)
- Two sufficient conditions for maximally restricted-edge-connected hypergraphs
- An edge extremal result for subcohesion
- The connectivity of hypergraphs
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
- Maximally connected \(p\)-partite uniform hypergraphs
- A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications
- The restricted edge-connectivity and \(\lambda^\prime\)-optimality of hypergraphs
This page was built for publication: Maximally edge-connected hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501024)
