Bahmanian, Mohammad A.; Sajna, Mateja Connection and separation in hypergraphs. (English) Zbl 1416.05197 Theory Appl. Graphs 2, No. 2, Article 5, 24 p. (2015). Summary: 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. Cited in 15 Documents MSC: 05C65 Hypergraphs 05C40 Connectivity 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:hypergraph; incidence graph; walk; trail; path; cycle; connected hypergraph; cut edge; cut vertex; separating vertex; block PDFBibTeX XMLCite \textit{M. A. Bahmanian} and \textit{M. Sajna}, Theory Appl. Graphs 2, No. 2, Article 5, 24 p. (2015; Zbl 1416.05197) Full Text: DOI