"Digraphs that have at most one walk of a given length with the same endpoints."

Zejun Huang, Xingzhi Zhan (2011)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2010.09.025

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/HuangZ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/HuangZ11
Zejun Huang, Xingzhi Zhan:
Digraphs that have at most one walk of a given length with the same endpoints. Discret. Math. 311(1): 70-79 (2011)

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.