"High Connectivity Keeping Sets In n-Connected Graphs."

Wolfgang Mader (2004)

> Home

Details and statistics

DOI: 10.1007/S00493-004-0027-6

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/Mader04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Mader04
Wolfgang Mader:
High Connectivity Keeping Sets In n-Connected Graphs. Comb. 24(3): 441-458 (2004)

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.