Graphs Suppressible to an Edge
Frank Harary, Jakob Krarup, A. J. Schwenk · Canadian Mathematical Bulletin · 1972
An application of graph theory to automatic traffic control [2] gave rise to the problem of deciding which connected graphs have points of degree 2 which can be successively suppressed until only a single edge remains.