"On spanning trees and k-connectedness in infinite graphs."

Reinhard Diestel (1992)

> Home

Details and statistics

DOI: 10.1016/0095-8956(92)90022-P

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/Diestel92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Diestel92
Reinhard Diestel:
On spanning trees and k-connectedness in infinite graphs. J. Comb. Theory B 56(2): 263-277 (1992)

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.