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

blockconnected hypergraphcut edgecut vertexcyclehypergraphincidence graphpathseparating vertextrailwalk

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

(31)

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

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)