In this paper, we characterize line graphs and total graphs that are hinge-free, i.e., there is no triple of vertices x, y, z such that the distance between y and z increases after x is removed. Based on our characterizations, we show that given a graph G
