Maximally connected \(p\)-partite uniform hypergraphs

DOI10.1016/j.dam.2018.11.004zbMath1414.05213OpenAlexW2903715642MaRDI QIDQ2422749

Jing Zhao, Erfang Shan, Li-ying Kang

Publication date: 20 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.11.004

zbMATH Keywords

hypergraphvertex connectivityedge connectivity\(p\)-partite hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Connectivity (05C40)

Related Items (2)

Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs ⋮ Connectivity of Cartesian product of hypergraphs

Cites Work

• Maximally edge-connected hypergraphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Sufficient conditions for equality of connectivity and minimum degree of a graph
• Connectivity in Hypergraphs
• Edge‐connectivity in p‐partite graphs

This page was built for publication: Maximally connected \(p\)-partite uniform hypergraphs