Edge-connectivity of permutation hypergraphs
نویسندگان
چکیده
منابع مشابه
Edge-connectivity of permutation hypergraphs
In this note we provide a generalization of a result of Goddard, Raines and Slater [4] on edge-connectivity of permutation graphs for hypergraphs. A permutation hypergraph Gπ is obtained from a hypergraph G by taking two disjoint copies of G 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 preser...
متن کاملEdge-connectivity of undirected and directed hypergraphs
The objective of the thesis is to discuss edge-connectivity and related connectivity conceptsin the context of undirected and directed hypergraphs. In particular, we focus on k-edge-connectivity and (k, l)-partition-connectivity of hypergraphs, and (k, l)-edge-connectivityof directed hypergraphs. A strong emphasis is placed on the role of submodularity in thestructural aspects o...
متن کاملEdge-Connectivity Augmentations of Graphs and Hypergraphs
A. Frank (Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math. 5(1), 22–53, 1992) developed a method to solve edgeconnectivity augmentation problems. His paper has stimulated further research in a number of directions, including many interesting generalizations. This paper surveys the current State of the Art on the edge-connectivity augmentation problem. Recent exte...
متن کاملEdge splitting and connectivity augmentation in directed hypergraphs
We prove theorems on edge splittings and edge-connectivity augmentation in directed hypergraphs, extending earlier results of Mader and Frank, respectively, on directed graphs. MSC Classification: 05C40, 05C65, 05C85, 05C20
متن کاملOn the 3-restricted edge connectivity of permutation graphs
An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G −W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.08.010