On short cycles through prescribed vertices of a polyhedral graph
Erhard Hexel (2005)
Discussiones Mathematicae Graph Theory
Similarity:
Guaranteed upper bounds on the length of a shortest cycle through k ≤ 5 prescribed vertices of a polyhedral graph or plane triangulation are proved.