"Digraphs that contain at most t distinct walks of a given length with the ..."

Zhenhua Lyu (2021)

> Home

Details and statistics

DOI: 10.1007/S10878-021-00718-0

access: closed

type: Journal Article

metadata version: 2021-03-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jco/Lyu21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/Lyu21
Zhenhua Lyu:
Digraphs that contain at most t distinct walks of a given length with the same endpoints. J. Comb. Optim. 41(3): 762-779 (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.