default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"An upper bound for the number of independent sets in regular graphs."

David J. Galvin (2009)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2009.06.031

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Galvin09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Galvin09
David J. Galvin:
An upper bound for the number of independent sets in regular graphs. Discret. Math. 309(23-24): 6635-6640 (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.