中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A characterization of the embeddability of graphs on the surface of given genus

文献类型:期刊论文

作者Liu, Y; Liu, YP
刊名CHINESE ANNALS OF MATHEMATICS SERIES B
出版日期1996-10-01
卷号17期号:4页码:457-462
关键词double graph eulerian directed circuit orientable surface embeddability
ISSN号0252-9599
英文摘要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.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:A1996WA56200007
出版者BALTZER SCI PUBL BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/28748]  
专题中国科学院数学与系统科学研究院
作者单位CHINESE ACAD SCI,INST APPL MATH,BEIJING 100080,PEOPLES R CHINA
推荐引用方式
GB/T 7714
Liu, Y,Liu, YP. A characterization of the embeddability of graphs on the surface of given genus[J]. CHINESE ANNALS OF MATHEMATICS SERIES B,1996,17(4):457-462.
APA Liu, Y,&Liu, YP.(1996).A characterization of the embeddability of graphs on the surface of given genus.CHINESE ANNALS OF MATHEMATICS SERIES B,17(4),457-462.
MLA Liu, Y,et al."A characterization of the embeddability of graphs on the surface of given genus".CHINESE ANNALS OF MATHEMATICS SERIES B 17.4(1996):457-462.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。