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

Qiuxin Wu*, Liming Xiong, Tingzeng Wu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationComputational Science - ICCS 2007 - 7th International Conference, Proceedings
PublisherSpringer Verlag
Pages397-400
Number of pages4
EditionPART 3
ISBN (Print)9783540725879
DOIs
Publication statusPublished - 2007
Event7th International Conference on Computational Science, ICCS 2007 - Beijing, China
Duration: 27 May 200730 May 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume4489 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Computational Science, ICCS 2007
Country/TerritoryChina
CityBeijing
Period27/05/0730/05/07

Keywords

  • Branch-bond
  • Claw-free graph
  • Even factor

Fingerprint

Dive into the research topics of 'Even factors with degree at most four in claw-free graphs'. Together they form a unique fingerprint.

Cite this