On Graphs, Which Can be Drawn on an Orientable Surface with Small Number of Intersections on an Edge

Let k and g be nonnegative integers. A graph is said to be k-nearly g-spherical if it can be drawn on an orientable surface of genus g so that each edge intersects at most k other edges in interior points. It is proved that if k ≤ 4, then the edge number of a k-nearly g-spherical graph on v vertices does not exceed (k + 3)(v + 2g − 2). It is also shown that the chromatic number of a k-nearly g-spherical graph does not exceed (Formula presented.). Bibliography: 4 titles. © 2016, Springer Science+Business Media New York.