Sharp upper bounds on the minimum number of components of 2factors in clawfree graphs
Broersma, Hajo and Paulusma, Daniël and Yoshimoto, Kiyoshi (2009) Sharp upper bounds on the minimum number of components of 2factors in clawfree graphs. Graphs and Combinatorics, 25 (4). pp. 427460. ISSN 09110119
PDF
Restricted to UT campus only : Request a copy 631kB 
Abstract:  Let be a clawfree graph with order and minimum degree . We improve results of Faudree et al. and Gould & Jacobson, and solve two open problems by proving the following two results. If , then has a 2factor with at most components, unless belongs to a finite class of exceptional graphs. If , then has a 2factor with at most components, unless is a complete graph. These bounds are best possible in the sense that we cannot replace 5/18 by a smaller quotient and we cannot replace by , respectively.

Item Type:  Article 
Copyright:  © 2009 Springer 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/70041 
Official URL:  http://dx.doi.org/10.1007/s0037300908557 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page