Closure, stability and iterated line graphs with a 2-factor

We consider 2-factors with a bounded number of components in the n -times iterated line graph L n ( G ) . We first give a characterization of graph G such that L n ( G ) has a 2-factor containing at most k components, based on the existence of a certain type of subgraph in G . This generalizes the main result of [L. Xiong, Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407–422]. We use this result to show that the minimum number of components of 2-factors in the iterated line graphs L n ( G ) is stable under the closure operation on a claw-free graph G . This extends results in [Z. Ryjáček, On a closure concept in claw-free graphs, J. Combin. Theory Ser. B 70 (1997) 217–224; Z. Ryjáček, A. Saito, R.H. Schelp, Closure, 2-factors and cycle coverings in claw-free graphs, J. Graph Theory 32 (1999) 109–117; L. Xiong, Z. Ryjáček, H.J. Broersma, On stability of the hamiltonian index under contractions and closures, J. Graph Theory 49 (2005) 104–115].