Finding an induced path that is not a shortest path

DOI10.1016/j.disc.2021.112398zbMath1466.05107arXiv2005.12861OpenAlexW3147054071MaRDI QIDQ2032716

Sophie Spirkl, Eli Berger, P. D. Seymour

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.12861

zbMATH Keywords

algorithmshortest pathinduced path

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Detours in directed graphs ⋮ Detecting a long odd hole

Cites Work

• Corrigendum to: On the complexity of testing for odd holes and induced odd paths

This page was built for publication: Finding an induced path that is not a shortest path