Finding an induced path that is not a shortest path

Eli Berger, Paul D. Seymour, Sophie Spirkl. Finding an induced path that is not a shortest path. Discrete Mathematics, 344(7):112398, 2021. [doi]

@article{BergerSS21,
  title = {Finding an induced path that is not a shortest path},
  author = {Eli Berger and Paul D. Seymour and Sophie Spirkl},
  year = {2021},
  doi = {10.1016/j.disc.2021.112398},
  url = {https://doi.org/10.1016/j.disc.2021.112398},
  researchr = {https://researchr.org/publication/BergerSS21},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {344},
  number = {7},
  pages = {112398},
}