Some boundary theorems of planar graphs, maps of parameters and their generalization

Abstract

In problems of modeling it is necessary to evaluate the possibility of creation of a simple graph prior to construction of its graphic representation. The method of constructive drawing of graph is suggested and the theorems of boundary number of possible non-crossed links for graphs with N nodes located on plane and on other surfaces are proved. Analogous theorems about color filling are proved, too.