On the structure of graphs with path-width at most two (Q2915439)

\textit{N.~G.~Kinnersley} and \textit{M.~A.~Langston} [Discrete Appl.\ Math. 54, No. ~2--3, 169--213 (1994; Zbl 0941.68590)] used a computer search to characterize the class of graphs with path-width at most two. There the excluded minor list consists of 110 graphs. The authors here concentrate on the building blocks of the graphs with path-width at most two and how they are glued together. The main result is that for 2-connected graphs with path-width at most two there exist only three excluded minors. So the authors get a short and compact characterization of 2-connected and 2-edge-connected graphs with path-width at most two.