I have a problem with the following statement :Every combinatorial embedding is equivalent to one with $\lambda(T) = 1$ on a spanning tree of GWhat does this mean ? OK in a spanning tree there isn't a cycle, so the signature of every edge is equal to $1$ but what is the sense of this statement? 
combinatorical embedding
graph theory;co.combinatorics;topological graph theory