ON THE UPPER EMBEDDABILITY OF THE PLANAR EMBEDDING OF GRAPHS
关于图的平面嵌入的一个上可嵌入性

This paper shows that if a loopless graph G can be embedded in the planesuch that the degree of every face does not exceed 5, then G is upper embeddable, i.e., theconjecture posed by R. Nedela and M. Skoviera in 4] is proved to be true when the surface Sis the plane.