In this paper we study various fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. We prove a number of new results involving these concepts. In particular, we describe the exact relationship between the block decomposition of a hypergraph and the block decomposition of its incidence graph.
Bahmanian, Mohammad A. and Sajna, Mateja
"Connection and separation in hypergraphs,"
Theory and Applications of Graphs:
2, Article 5.
Available at: http://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/5