"A sufficient condition for graphs to be weaklyk-linked."

Andreas Huck (1991)

> Home

Details and statistics

DOI: 10.1007/BF01787639

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/Huck91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Huck91
Andreas Huck:
A sufficient condition for graphs to be weaklyk-linked. Graphs Comb. 7(4): 323-351 (1991)

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.