an:06083270
Zbl 1289.05443
Bar??t, J??nos; Hajnal, P??ter; Lin, Yixun; Yang, Aifeng
On the structure of graphs with path-width at most two
EN
Stud. Sci. Math. Hung. 49, No. 2, 211-222 (2012).
00307030
2012
j
05C83 05C75 05C38
path-width; excluded minor; block
\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.
Michael Hager (Leonberg)
Zbl 0941.68590