Neil Jami

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1