If an endpoint of a longest path is adjacent to an internal vertex, replacing the incident path edge by that chord produces another longest path with the same vertexset and a new endpoint. Every neighbour of every endpoint obtained this way must remain on the original path.
