中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A characterization of the graphs with high degree sum that are not covered by three cycles

文献类型:期刊论文

作者Chiba, Shuya1; Tsugaki, Masao2
刊名ARS COMBINATORIA
出版日期2016-07-01
卷号128页码:127-163
关键词Degree sum Cycle cover
ISSN号0381-7032
英文摘要Let G be a graph of order n. In [A. Saito, Degree sums and graphs that are not covered by two cycles, J. Graph Theory 32 (1999), 51-61.], Saito characterized the graphs with sigma(3)(G) >= n - 1 that are not covered by two cycles. In this paper, we characterize the graphs with sigma(4) (G) >= n - 1 that are not covered by three cycles. Moreover, to prove our main theorem, we show several new results which are useful in the study of this area.
资助项目JSPS[23740087] ; Chinese Academy of Science[2012Y1JA0004]
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000380622200010
出版者CHARLES BABBAGE RES CTR
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/23317]  
专题中国科学院数学与系统科学研究院
通讯作者Chiba, Shuya
作者单位1.Kumamoto Univ, Dept Math & Engn, 2-39-1 Kurokami, Kumamoto 8608555, Japan
2.Chinese Acad Sci, Inst Math & Syst Sci, Beijing, Peoples R China
推荐引用方式
GB/T 7714
Chiba, Shuya,Tsugaki, Masao. A characterization of the graphs with high degree sum that are not covered by three cycles[J]. ARS COMBINATORIA,2016,128:127-163.
APA Chiba, Shuya,&Tsugaki, Masao.(2016).A characterization of the graphs with high degree sum that are not covered by three cycles.ARS COMBINATORIA,128,127-163.
MLA Chiba, Shuya,et al."A characterization of the graphs with high degree sum that are not covered by three cycles".ARS COMBINATORIA 128(2016):127-163.

入库方式: OAI收割

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

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

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