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

For c⩾2 and k⩽min{c,3}, guaranteed upper bounds on the length of a shortest cycle through k prescribed vertices of a c-connected graph are proved. Analogous results on planar graphs are presented, too.