In this talk we find an upper bound on the lattice stick number of a spatial graph G with e edges, v vertices, b bouquet cut-components, in terms of the minimal crossing number c(K)
which is s_{L} \leq 3c(G)+6e-4v+3b-3.