  We give an algorithm to calculate the minimal and maximal genus of the
orientable closed surface where a graph $G$ can be embedded. For this, we
construct some special branched coverings of the 2-sphere. We apply this
algorithm to calculate the orientable genus and maximal genus of some Snarks
graphs.
