A near-triangular embedding is an embedded graph into some surface whose all but one facial walks are 3-gons. In this paper we show that if a graph G is a triangulation of an orientable surface Sh, then G has a near-t...A near-triangular embedding is an embedded graph into some surface whose all but one facial walks are 3-gons. In this paper we show that if a graph G is a triangulation of an orientable surface Sh, then G has a near-triangular embedding into Sk for k=h, h＋1,...1,[β（G）/2], where β（G） is the Betti number of G.展开更多
The embedding technique based on an operator appeared in [Liu, Y. P., Scientia Sinica, Special Issue on Math,1 (1979),191-201 (in Chinese)] for determining the maximum non-orientable genus of a graph is developed to o...The embedding technique based on an operator appeared in [Liu, Y. P., Scientia Sinica, Special Issue on Math,1 (1979),191-201 (in Chinese)] for determining the maximum non-orientable genus of a graph is developed to obtain the general theorem which presents a necessary and sufficient condition for a graph to be embeddable into either the orientable or the non-orientable surface of genus k. Furthermore,the greatest lower bound of the lengths of genus ranges of the class of nonplanar graphs which are up-embeddable is also obtained.展开更多
基金the National Natural Science Foundation of China (19831080)Shanghai City Fundation of Selected Academic Research (04JC14031)
文摘A near-triangular embedding is an embedded graph into some surface whose all but one facial walks are 3-gons. In this paper we show that if a graph G is a triangulation of an orientable surface Sh, then G has a near-triangular embedding into Sk for k=h, h＋1,...1,[β（G）/2], where β（G） is the Betti number of G.
文摘The embedding technique based on an operator appeared in [Liu, Y. P., Scientia Sinica, Special Issue on Math,1 (1979),191-201 (in Chinese)] for determining the maximum non-orientable genus of a graph is developed to obtain the general theorem which presents a necessary and sufficient condition for a graph to be embeddable into either the orientable or the non-orientable surface of genus k. Furthermore,the greatest lower bound of the lengths of genus ranges of the class of nonplanar graphs which are up-embeddable is also obtained.
