"Every 4k-edge-connected graph is Weakly 3k-linked."

Haruko Okamura (1990)

> Home

Details and statistics

DOI: 10.1007/BF01787729

access: closed

type: Journal Article

metadata version: 2020-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/Okamura90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Okamura90
Haruko Okamura:
Every 4k-edge-connected graph is Weakly 3k-linked. Graphs Comb. 6(2): 179-185 (1990)

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.