Sufficient conditions for hypergraphs to be maximally edge-connected
type: Item
instance of: scholarly article
title: Sufficient conditions for hypergraphs to be maximally edge-connected
zbMATH Open document ID: 1427.05153
author: Shuang Zhao
author: Jixiang Meng
published in: Applied Mathematics and Computation
publication date: 2019-11-13T00:00:00Z
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 7129951
zbMATH Keywords: edge-connectivity
zbMATH Keywords: hypergraph
zbMATH Keywords: maximally edge-connected
MaRDI profile type: Publication
full work available at URL: j.amc.2018.03.109
OpenAlex ID: W2799844489
cites work: Q3941433
cites work: Q3993087
cites work: Augmenting hypergraphs by edges of size two
cites work: Edge-augmentation of hypergraphs
cites work: Inverse degree and edge-connectivity
cites work: Maximally edge-connected hypergraphs
cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey
cites work: Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
cites work: Q4079637
cites work: Q3356329
cites work: Sufficient conditions for maximally connected dense graphs
cites work: Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
cites work: HYPERGRAPHS
DOI: 10.1016/J.AMC.2018.03.109
description: scientific article