"Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, ..."

Zhen-Mu Hong et al. (2021)

> Home

Details and statistics

DOI: 10.1155/2021/5588146

access: open

type: Journal Article

metadata version: 2021-03-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/complexity/HongXCV21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/complexity/HongXCV21
Zhen-Mu Hong, Zheng-Jiang Xia, Fu-Yuan Chen, Lutz Volkmann:
Sufficient Conditions for Graphs to Be k -Connected, Maximally Connected, and Super-Connected. Complex. 2021: 5588146:1-5588146:11 (2021)

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.