Edge-connectivity of permutation hypergraphs

DOI10.1016/J.DISC.2011.08.010MaRDI QIDQ442359zbMATH OpenOpenAlexFDO

Authors Neil Jami, Zoltán Szigeti

Publication date 10 August 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.08.010

zbMATH Keywords

hypergraphpermutation graphedge-connectivity augmentation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 5519216
• scientific article; zbMATH DE number 4110724
• Maximally edge-connected hypergraphs
• On the 3-restricted edge connectivity of permutation graphs
• Edge-connectivity in hypergraphs

Cites work

• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Distance and connectivity measures in permutation graphs
• Edge-Connectivity Augmentation with Partition Constraints

Cited in

(5)

• Edge-connectivity in hypergraphs
• The edge‐connectivity of vertex‐transitive hypergraphs
• scientific article; zbMATH DE number 5519216 (Why is no real title available?)
• Sufficient conditions for maximally edge-connected hypergraphs
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph

This page was built for publication: Edge-connectivity of permutation hypergraphs

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