you give bipartite graph GUVE U set vertex V set vertex second e set edge there multiple edgeslet subset edge kcovere iff graph vertex incident k edge Minimal kcovering kcovering size subset minimal possibleyour task find minimal kcovere mindegree minimal degree vertex graph g