A characterization of the embeddability of graphs on the surface of given genus

CSpace

	A characterization of the embeddability of graphs on the surface of given genus
	Liu, Y; Liu, YP
	1996-10-01
发表期刊	CHINESE ANNALS OF MATHEMATICS SERIES B
ISSN	0252-9599
卷号	17 期号:4 页码:457-462
摘要	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
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:A1996WA56200007
出版者	BALTZER SCI PUBL BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/28749
专题	中国科学院数学与系统科学研究院
作者单位	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.