This week I shall finish my discussion about searching graphs by looking at the recent paper by Clarke and MacGillavray that characterizes graphs that are k-searchable.