"The minimum number of e-vertex-covers among hypergraphs with e edges of ..."

F. H. Chang et al. (2009)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2008.05.006

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/ChangFHL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/ChangFHL09
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. Discret. Appl. Math. 157(1): 164-169 (2009)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.