Connection and separation in hypergraphs
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 blo...
Main Authors: | Mohammad Bahmanian, Mateja Sajna |
---|---|
Format: | Article |
Language: | English |
Published: |
Georgia Southern University
2015-01-01
|
Series: | Theory and Applications of Graphs |
Subjects: | |
Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/5 |
Similar Items
-
Hypergraph cuts with edge-dependent vertex weights
by: Yu Zhu, et al.
Published: (2022-07-01) -
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
by: Thomas Schweser, et al.
Published: (2021-04-01) -
Generalized Hypergraph Coloring
by: Schweser Thomas
Published: (2021-02-01) -
Extending Potočnik and Šajna’s Conditions on the Existence of Vertex-Transitive Self-Complementary k-Hypergraphs
by: Lesniak Linda, et al.
Published: (2023-02-01) -
On the graph connectivity and the variable sum exdeg index
by: Jianwei Du, et al.
Published: (2021-11-01)