Ribbon Graphs and Belyi Pairs with Partially Prescribed Branching

Given a ribbon graph of arbitrary genus, we construct a spherical graph with the same two columns of the passport. And given a spherical graph, we present an algorithm for constructing a graph with the two columns of the same passport and any admissible genus. We also discuss possible applications to the theory of dessins d'enfants.