A note on the tree decompositions of graphs (Q1387426)

Consider a connected graph \(G\) with \(n\geq 3\) vertices and \(2n-4\) edges. Suppose \(u\) and \(v\) are two vertices which do not have an edge between them in \(G\). The author presents necessary and sufficient conditions for the possibility of \(G\) to be decomposed into two trees, respectively with \(n\) vertices and \(n-2\) vertices and without the vertices \(u\) and \(v\) for the second case, if and only if (i) the number of edges in \(H\), \(\varepsilon(H)\leq 2(| H|- 1)-| H\cap\{u,v\}|\) for any induced subgraph \(H\) of \(G\) with order at least 3, and (ii) there are no two connected induced subgraphs \(H_1\) and \(H_2\) of \(G\) with \(\varepsilon(H_i)= 2(| H_i|- 2)\) for \(i=1\) and 2 such that \(H_1\cap H_2=\{u,v\}\).