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

Qiuxin Wu; Liming Xiong; Tingzeng Wu

doi:10.1007/978-3-540-72588-6_65

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

Qiuxin Wu^*
, Liming Xiong
, Tingzeng Wu

^*此作品的通讯作者

数学学院

Beijing Institute of Machinery
Qinghai Nationalities College

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

摘要

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	https://doi.org/10.1007/978-3-540-72588-6_65
出版状态	已出版 - 2007
活动	7th International Conference on Computational Science, ICCS 2007 - Beijing, 中国期限: 27 5月 2007 → 30 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/07 → 30/05/07

访问文件

10.1007/978-3-540-72588-6_65

其它文件与链接

链接到 Scopus 的出版物

引用此

Wu, Q., Xiong, L., & Wu, T. (2007). Even factors with degree at most four in claw-free graphs. 在 Computational Science - ICCS 2007 - 7th International Conference, Proceedings (PART 3 编辑, 页码 397-400). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 4489 LNCS, 号码 PART 3). Springer Verlag. https://doi.org/10.1007/978-3-540-72588-6_65

Wu, Qiuxin ; Xiong, Liming ; Wu, Tingzeng. / Even factors with degree at most four in claw-free graphs. Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3. 编辑 Springer Verlag, 2007. 页码 397-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).

@inproceedings{3bee70fc7616450eab8ca61ef598bca4,

title = "Even factors with degree at most four in claw-free graphs",

abstract = "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.",

keywords = "Branch-bond, Claw-free graph, Even factor",

author = "Qiuxin Wu and Liming Xiong and Tingzeng Wu",

year = "2007",

doi = "10.1007/978-3-540-72588-6\_65",

language = "English",

isbn = "9783540725879",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 3",

pages = "397--400",

booktitle = "Computational Science - ICCS 2007 - 7th International Conference, Proceedings",

address = "Germany",

edition = "PART 3",

note = "7th International Conference on Computational Science, ICCS 2007 ; Conference date: 27-05-2007 Through 30-05-2007",

}

Wu, Q, Xiong, L & Wu, T 2007, Even factors with degree at most four in claw-free graphs. 在 Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3 版本, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 号码 PART 3, 卷 4489 LNCS, Springer Verlag, 页码 397-400, 7th International Conference on Computational Science, ICCS 2007, Beijing, 中国, 27/05/07. https://doi.org/10.1007/978-3-540-72588-6_65

Even factors with degree at most four in claw-free graphs. / Wu, Qiuxin; Xiong, Liming; Wu, Tingzeng.
Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3. 编辑 Springer Verlag, 2007. 页码 397-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 4489 LNCS, 号码 PART 3).

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

TY - GEN

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

AU - Wu, Qiuxin

AU - Xiong, Liming

AU - Wu, Tingzeng

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Branch-bond

KW - Claw-free graph

KW - Even factor

UR - https://www.scopus.com/pages/publications/38149084712

U2 - 10.1007/978-3-540-72588-6_65

DO - 10.1007/978-3-540-72588-6_65

M3 - Conference contribution

AN - SCOPUS:38149084712

SN - 9783540725879

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 397

EP - 400

BT - Computational Science - ICCS 2007 - 7th International Conference, Proceedings

PB - Springer Verlag

T2 - 7th International Conference on Computational Science, ICCS 2007

Y2 - 27 May 2007 through 30 May 2007

ER -

Wu Q, Xiong L, Wu T. Even factors with degree at most four in claw-free graphs. 在 Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3 编辑 Springer Verlag. 2007. 页码 397-400. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3). doi: 10.1007/978-3-540-72588-6_65

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

摘要

丛书

会议

访问文件

其它文件与链接

学术指纹

引用此