"Sufficient degree conditions for k-edge-connectedness of a graph."

Douglas Bauer et al. (2009)

> Home

Details and statistics

DOI: 10.1002/NET.20299

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/BauerHKS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BauerHKS09
Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel:
Sufficient degree conditions for k-edge-connectedness of a graph. Networks 54(2): 95-98 (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.