default search action

combined dblp search
author search
venue search
publication search

ask others

"Bounding the distance among longest paths in a connected graph."

Jan Ekstein et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2017.09.029

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/EksteinFKT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/EksteinFKT18
Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska:
Bounding the distance among longest paths in a connected graph. Discret. Math. 341(4): 1155-1159 (2018)

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.