Augmenting and preserving partition connectivity of a hypergraph
From MaRDI portal
Publication:482272
DOI10.4310/JOC.2014.v5.n3.a1zbMath1305.05112MaRDI QIDQ482272
Publication date: 22 December 2014
Published in: Journal of Combinatorics (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (2)
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs ⋮ On hamiltonian line graphs of hypergraphs
This page was built for publication: Augmenting and preserving partition connectivity of a hypergraph