1 paper
Mikio Kano, Shun-ichi Maezawa, Akira Saito +1
A Berge k-factor in a hypergraph is a generalization of a k-factor in a graph. In this paper, we study the problem of determining the values k such that every I^»-edge-conne…