On short cycles through prescribed vertices of a polyhedral graph

Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane triangulation are proved

A look at cycles containing specified elements of a graph

AbstractThis article is intended as a brief survey of problems and results dealing with cycles containing specified elements of a graph. It is hoped that this will help researchers in the area to identify problems and areas of concentration