Shortest walks in almost claw-free graphs.
Odile Favaron, Evelyne Flandrin, Hao Li, Zdeněk Ryjáček · 1996
There have been many results concerning claw-free graphs and hamiltonicity. Recently, Jackson and Wormald have obtained more general results on walks in claw-free graphs. In this paper, we consider the family of almost claw-free graphs that contains the previous one, and give some results on walks, especially on shortest covering walks visiting only once some given vertices.