PATH SATURATED GRAPHS
Yehuda Ashkenazi · International Journal of Pure and Apllied Mathematics · 2011
This paper deals with characterization for a graph to be saturated according to a path of order m. In this paper we have a full characterization for a connected graph to be Pm-saturated for m � 6 and we have some general results, closing with a conjecture for the related Turan type problem.