Abstract :
It is proved that each polyhedral graph that contains a vertex of degree at least 52k, contains also a path Pk on k vertices such that k−1 of its vertices are of degree at most 52k and the remaining one is of degree at most 5k in G. This improves a recent result of Jendrol’ and Fabrici.
