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

^*Corresponding author for this work

School of Mathematics and Statistics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Computational Science - ICCS 2007 - 7th International Conference, Proceedings
Publisher	Springer Verlag
Pages	397-400
Number of pages	4
Edition	PART 3
ISBN (Print)	9783540725879
DOIs	https://doi.org/10.1007/978-3-540-72588-6_65
Publication status	Published - 2007
Event	7th International Conference on Computational Science, ICCS 2007 - Beijing, China Duration: 27 May 2007 → 30 May 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 3
Volume	4489 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Conference on Computational Science, ICCS 2007
Country/Territory	China
City	Beijing
Period	27/05/07 → 30/05/07

Keywords

Branch-bond
Claw-free graph
Even factor

Access to Document

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

Cite this

Wu, Q., Xiong, L., & Wu, T. (2007). Even factors with degree at most four in claw-free graphs. In Computational Science - ICCS 2007 - 7th International Conference, Proceedings (PART 3 ed., pp. 397-400). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4489 LNCS, No. 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. ed. Springer Verlag, 2007. pp. 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. in Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 4489 LNCS, Springer Verlag, pp. 397-400, 7th International Conference on Computational Science, ICCS 2007, Beijing, China, 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. ed. Springer Verlag, 2007. p. 397-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4489 LNCS, No. PART 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - http://www.scopus.com/inward/record.url?scp=38149084712&partnerID=8YFLogxK

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. In Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3 ed. Springer Verlag. 2007. p. 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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this