We use a new coloured multi-graph constructive method to prove that if the edge-set of a graph G = (V,E) has a partition into two spanning trees T1 and T2 then there is a map p : V → R2, p(v) = (p(v)1,p(v)2), such that ...