"Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum ..."

Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald (2002)

> Home

Details and statistics

DOI: 10.1017/S0963548302005229

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/MckayWW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/MckayWW02
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald:
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. Comb. Probab. Comput. 11(4): 373-392 (2002)

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.