"An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum ..."

Xinmin Hou, Bolian Liu, Tianming Wang (2003)

> Home

Details and statistics

DOI: 10.1007/S00373-002-0488-6

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/HouLW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/HouLW03
Xinmin Hou, Bolian Liu, Tianming Wang:
An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter. Graphs Comb. 19(1): 111-119 (2003)

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.