Augmenting and preserving partition connectivity of a hypergraph

DOI10.4310/JOC.2014.V5.N3.A1zbMATH Open1305.05112MaRDI QIDQ482272FDOQ482272

Authors: Xiaofeng Gu, Hong-Jian Lai 

Publication date: 22 December 2014

Published in: Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• The connectivity of hypergraphs
• Edge-connectivity in hypergraphs
• Maximally connected \(p\)-partite uniform hypergraphs

zbMATH Keywords

\(k\)-partition-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (8)

• Edge splitting and connectivity augmentation in directed hypergraphs.
• Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
• On hamiltonian line graphs of hypergraphs
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Cyclic base ordering of generalized Petersen graphs
• Cyclic base ordering of certain degenerate graphs

This page was built for publication: Augmenting and preserving partition connectivity of a hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482272)