"Minimum degree k and k-connectedness usually arrive together."

Sahar Diskin, Anna Geisler (2025)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2025.114453

access: closed

type: Journal Article

metadata version: 2025-03-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/DiskinG25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/DiskinG25
Sahar Diskin, Anna Geisler:
Minimum degree k and k-connectedness usually arrive together. Discret. Math. 348(7): 114453 (2025)

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.