Edge-connectivity of permutation hypergraphs

详细信息    查看全文

• 作者：Neil Jami ; Zolt¨¢n Szigeti
• 关键词：Permutation graph ; Edge-connectivity augmentation ; Hypergraph
• 刊名：Discrete Mathematics
• 出版年：2012
• 出版时间：6 September, 2012
• 年：2012
• 卷：312
• 期：17
• 页码：2536-2539
• 全文大小：217 K

文摘

In this note we provide a generalization of a result of Goddard?et?al. (2003) on edge-connectivity of permutation graphs for hypergraphs. A permutation hypergraph is obtained from a hypergraph by taking two disjoint copies of and by adding a perfect matching between them. The main tool in the proof of the graph result was the theorem on partition constrained splitting off preserving -edge-connectivity due to Bang-Jensen et?al. (1999)?. Recently, this splitting off theorem was extended for hypergraphs by Bern¨¢th et?al. (accepted in Journal of Graph Theory)?. This extension made it possible to find a characterization of hypergraphs for which there exists a -edge-connected permutation hypergraph.