A graph partition problem (Q1367109)

Let \(G= (V,E)\) be a graph, and \(e_1\), \(e_2\) disjoint edges of \(G\). Suppose that \(E-\{e_1,e_2\}\) can be partitioned into sets \(E_1\) and \(E_2\), where \(G_i\) is the subgraph spanned by \(E_i\), \(i=1,2\). Also suppose that \(G_1\) has each of its components unicyclic and \(G_2\) has exactly four components that are trees, each one incident to a different vertex of \(e_1\) or \(e_2\). In such a case the graph is said to have an \((e_1,e_2)\)-basic partition. That this definition is quite restrictive is illustrated by the simple consequence that \(|E|= 2|V|-2\). The authors find a forbidden configuration characterization of graphs with an \((e_1, e_2)\)-basic partition.