  In this paper we show that every finite spatial graph is a connected sum of a
planar graph, which is a forest, i.e. disjoint union of finite number of trees
and a tangle.
  As a consequence we get that any finite spatial graph is a connected sum of a
planar graph and a braid. Using these decompositions it is not difficult to
find a set of generators and defining relations for the fundamental group of
compliment of a spatial graph in 3-space $\mathbb{R}^3$.
