BibTeX record journals/dm/EksteinFKT18

download as .bib file

@article{DBLP:journals/dm/EksteinFKT18,
  author       = {Jan Ekstein and
                  Shinya Fujita and
                  Adam Kabela and
                  Jakub Teska},
  title        = {Bounding the distance among longest paths in a connected graph},
  journal      = {Discret. Math.},
  volume       = {341},
  number       = {4},
  pages        = {1155--1159},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.disc.2017.09.029},
  doi          = {10.1016/J.DISC.2017.09.029},
  timestamp    = {Sat, 22 Feb 2020 13:57:13 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/EksteinFKT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.