We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

On components of 2-factors in claw-free graphs.

Broersma, H.J. and Paulusma, D. and Yoshimoto, K. (2007) 'On components of 2-factors in claw-free graphs.', Electronic notes in discrete mathematics., 29 . pp. 289-293.


For a non-hamiltonian claw-free graph G with order n and minimum degree δ we show the following. If δ=4, then G has a 2-factor with at most (5n−14)/18 components, unless G belongs to a finite class of exceptional graphs. If δ⩾5, then G has a 2-factor with at most (n−3)/(δ−1) components. These bounds are sharp in the sense that we can replace nor 5/18 by a smaller quotient nor δ−1 by δ.

Item Type:Article
Keywords:Claw-free graph, 2-factor, Minimum degree, Edge degree
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:August 2007
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar