Connection and separation in hypergraphs

Authors

Mohammad A. Bahmanian, Illinois State UniversityFollow
Mateja Sajna, University of OttawaFollow

Publication Date

2015

Abstract

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.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Bahmanian, Mohammad A. and Sajna, Mateja (2015) "Connection and separation in hypergraphs," Theory and Applications of Graphs: Vol. 2: Iss. 2, Article 5.
DOI: 10.20429/tag.2015.020205
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/5