On families of geometric parasitic solutions for Belyi systems of genus zero

This paper is devoted to interrelations between the combinatorial structure of plane graphs and algebraic properties of systems of equations related to Belyi functions for these graphs. The main purpose is to describe some families of plane graphs possessing parasitic solutions and some families of plane graphs such that each solution of the corresponding systems is not parasitic and has multiplicity one.