Maximally edge-connected hypergraphs

DOI10.1016/j.disc.2015.07.008zbMath1322.05100OpenAlexW2195176792MaRDI QIDQ501024

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

zbMATH Keywords

hypergraphconnectivityedge connectivitymaximally edge-connected graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Connectivity (05C40)

Related Items (9)

Super Edge-Connected Linear Hypergraphs ⋮ Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Maximally connected \(p\)-partite uniform hypergraphs ⋮ The edge‐connectivity of vertex‐transitive hypergraphs ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ Sufficient conditions for maximally edge-connected hypergraphs ⋮ Edge-connectivity in hypergraphs ⋮ Connectivity of Cartesian product of hypergraphs ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected

Cites Work

• 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
• HYPERGRAPHS
• A Graph-Theoretic Approach to a Communications Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximally edge-connected hypergraphs