"On the existence of N-connected graphs with prescribed degrees (n ≧ 2)."

D. L. Wang, Daniel J. Kleitman (1973)

> Home

Details and statistics

DOI: 10.1002/NET.3230030303

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/WangK73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/WangK73
D. L. Wang, Daniel J. Kleitman:
On the existence of N-connected graphs with prescribed degrees (n ≧ 2). Networks 3(3): 225-239 (1973)

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.