期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A CHARACTERIZATION OF THE EMBEDDABILITY OF GRAPHS ON THE SURFACE OF GIVEN GENUS 被引量:1
1
作者 刘莹 刘彦佩 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 1996年第4期457-462,共6页
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. 展开更多
关键词 Double graph Eulerian directed circuit Orientable surface Embeddability
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部