On short paths through prescribed vertices of a graph Original Research Article

For an integer image and image, guaranteed upper bounds on the length of a shortest path through k prescribed vertices of a c-connected graph or a c-connected planar graph are proved.