The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks

F. H. Chang, Hung-Lin Fu, Frank K. Hwang, B. C. Lin. The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. Discrete Applied Mathematics, 157(1):164-169, 2009. [doi]

Authors

F. H. Chang

This author has not been identified. Look up 'F. H. Chang' in Google

Hung-Lin Fu

This author has not been identified. Look up 'Hung-Lin Fu' in Google

Frank K. Hwang

This author has not been identified. Look up 'Frank K. Hwang' in Google

B. C. Lin

This author has not been identified. Look up 'B. C. Lin' in Google