Bounding cochordal cover number of graphs via vertex stretching

In this paper, it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases at most two. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipartite or weakly chordal graph.