Connection and separation in hypergraphs

DOI10.20429/TAG.2015.020205MaRDI QIDQ5225516zbMATH OpenOpenAlexFDO

Authors Mohammad A. Bahmanian, Mateja Šajna

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2015.020205

zbMATH Keywords

blockcut edgecyclehypergraphpathcut vertexincidence graphwalkconnected hypergraphtrailseparating vertex

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3933118
• Edge-connectivity in hypergraphs
• Connectivity in hypergraphs
• The connectivity of hypergraphs
• Maximally edge-connected hypergraphs

Cited in

(23)

• Hypergraphs of Bounded Disjointness
• On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs
• The edge‐connectivity of vertex‐transitive hypergraphs
• On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
• Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs
• Finding the shortest path for a hypergraph
• Using edge cuts to find Euler tours and Euler families in hypergraphs
• On \(c\)-spaces and hypergraphs
• Sufficient conditions for maximally edge-connected hypergraphs
• Separable and equatable hypergraphs
• Covering hypergraphs are Eulerian
• Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
• Connectivity of Cartesian product of hypergraphs
• The weak hyperedge tenacity of the hypercycles
• scientific article; zbMATH DE number 3933118 (Why is no real title available?)
• On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
• Finding a minimal spanning hypertree of a weighted hypergraph
• Whitney's connectivity inequalities for directed hypergraphs
• The geometry connectivity of hypergraphs
• Level hypergraphs
• Community Detection in General Hypergraph Via Graph Embedding
• On the structure of a 3-connected graph. II
• On a connection between the switching separability of a graph and that of its subgraphs

This page was built for publication: Connection and separation in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225516)