Connectivity of Cartesian product of hypergraphs
From MaRDI portal
Recommendations
- Sufficient conditions for hypergraphs to be maximally edge-connected and super-edge-connected
- Connectivity and super-connectivity of Cartesian product graphs.
- Edge-connectivity in hypergraphs
- Sufficient conditions for maximally edge-connected hypergraphs
- Sufficient conditions for hypergraphs to be maximally edge-connected
Cites work
- A characterization of cube-hypergraphs
- Congruent Graphs and the Connectivity of Graphs
- Connection and separation in hypergraphs
- Connectivity in hypergraphs
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
- scientific article; zbMATH DE number 5064049 (Why is no real title available?)
- HYPERGRAPHS
- Maximally connected \(p\)-partite uniform hypergraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Maximally edge-connected hypergraphs
- On connectivity of the cartesian product of two graphs
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Sufficient conditions for maximally edge-connected hypergraphs
- Super edge- and point-connectivities of the Cartesian product of regular graphs
Cited in
(7)- On connectivity of the cartesian product of two graphs
- The Cartesian product of hypergraphs
- On super connectivity of Cartesian product graphs
- scientific article; zbMATH DE number 1112677 (Why is no real title available?)
- The connectivity of hypergraphs
- On the size of linear r-uniform hypergraphs and sufficient conditions for maximally edge-connected hypergraphs
- Connectivity of Cartesian products of graphs
This page was built for publication: Connectivity of Cartesian product of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079817)
