Eli Berger, Paul Seymour, Sophie Spirkl
Published 2020-05-26Version 1
We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
4-coloring ($P_6$, bull)-free graphs
Shortest paths in the Tower of Hanoi graph and finite automata
Coloring ($P_5$, bull)-free graphs
![QR code for arXiv:2005.12861 [math.CO]](http://oss.arxitics.com/images/favicon.svg)