@article{3bbd04b948884d988b0681ebc9524875,
title = "The upper bound of the number of cycles in a 2-factor of a line graph",
abstract = "Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-factor with at most 3n-2/8 components. For a simple graph with minimum degree at least three also, the same conclusion holds.",
keywords = "2-factor, Line graph, Number of components",
author = "Jun Fujisawa and Liming Xiong and Kiyoshi Yoshimoto and Shenggui Zhang",
year = "2007",
month = may,
doi = "10.1002/jgt.20220",
language = "English",
volume = "55",
pages = "72--82",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",
}