Article ID Journal Published Year Pages File Type
4651152 Discrete Mathematics 2007 6 Pages PDF
Abstract

For an integer c⩾2c⩾2 and k=2,3k=2,3, 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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On short paths through prescribed vertices of a graph
Authors
,