Even factors with degree at most four in claw-free graphs

Qiuxin Wu*, Liming Xiong, Tingzeng Wu

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

In this paper we will prove that every simple claw-free graph G with the minimum degree at least two such that each of its odd branchbonds contains a branch of length one has an even factor of degree 2 or 4. Some examples showed the conclusion can not be replaced by "2-factor" even for 2-connected graphs.

源语言英语
主期刊名Computational Science - ICCS 2007 - 7th International Conference, Proceedings
出版商Springer Verlag
397-400
页数4
版本PART 3
ISBN(印刷版)9783540725879
DOI
出版状态已出版 - 2007
活动7th International Conference on Computational Science, ICCS 2007 - Beijing, 中国
期限: 27 5月 200730 5月 2007

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
编号PART 3
4489 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议7th International Conference on Computational Science, ICCS 2007
国家/地区中国
Beijing
时期27/05/0730/05/07

指纹

探究 'Even factors with degree at most four in claw-free graphs' 的科研主题。它们共同构成独一无二的指纹。

引用此