中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A [k, k+1]-factor containing given Hamiltonian cycle

文献类型:期刊论文

作者Cai, MC; Li, YJ; Kano, M
刊名SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY
出版日期1998-09-01
卷号41期号:9页码:933-938
关键词graph connected factor Hamiltonian cycle
ISSN号1006-9283
英文摘要Let k greater than or equal to 2 be an integer and let G be a graph of order n with minimum degree at least k; n greater than or equal to 8 k - 16 for even n and n greater than or equal to 6k - 13 for odd n. If the degree sum of each pair of nonadjacent vertices of G is at least n, then for any given Hamiltonian cycle C, G has a [k, k + 1]-factor containing C.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000076532600005
出版者SCIENCE PRESS
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/13337]  
专题中国科学院数学与系统科学研究院
通讯作者Cai, MC
作者单位1.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
2.Ibaraki Univ, Dept Comp & Informat Sci, Hitachi, Ibaraki 316, Japan
推荐引用方式
GB/T 7714
Cai, MC,Li, YJ,Kano, M. A [k, k+1]-factor containing given Hamiltonian cycle[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,1998,41(9):933-938.
APA Cai, MC,Li, YJ,&Kano, M.(1998).A [k, k+1]-factor containing given Hamiltonian cycle.SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,41(9),933-938.
MLA Cai, MC,et al."A [k, k+1]-factor containing given Hamiltonian cycle".SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY 41.9(1998):933-938.

入库方式: OAI收割

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

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

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