Connectivity of Cartesian product of hypergraphs

DOI10.1007/s41980-021-00641-4zbMath1495.05160OpenAlexW3207136773MaRDI QIDQ2079817

Yingzhi Tian, Na Wang, Ji Xiang Meng

Publication date: 30 September 2022

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-021-00641-4

zbMATH Keywords

hypergraphsCartesian productsuper edge-connected graphsuper vertex-connected graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Maximally edge-connected hypergraphs
• Connectivity of Cartesian product graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Connectivity of Cartesian products of graphs
• On connectivity of the cartesian product of two graphs
• A characterization of cube-hypergraphs
• Sufficient conditions for maximally edge-connected hypergraphs
• Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
• Sufficient conditions for hypergraphs to be maximally edge-connected
• Maximally connected \(p\)-partite uniform hypergraphs
• HYPERGRAPHS
• Congruent Graphs and the Connectivity of Graphs
• Connectivity in Hypergraphs
• Super edge- and point-connectivities of the Cartesian product of regular graphs
• Connection and separation in hypergraphs

This page was built for publication: Connectivity of Cartesian product of hypergraphs