论文信息 - On the 2-factor index of a graph

On the 2-factor index of a graph

The 2-factor index of a graph G, denoted by f(G), is the smallest integer m such that the m-iterated line graph L^m(G) of G contains a 2-factor. In this paper, we provide a formula for f(G), and point out that there is a polynomial time algorithm to determine f(G).

Mingchu Li | Liming Xiong

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] Liming Xiong,et al. Hamiltonian iterated line graphs , 2002, Discret. Math..

[3] Terry A. McKee. Recharacterizing Eulerian: Intimations of new duality , 1984, Discret. Math..

[4] Stephen G. Hartke,et al. The structure and existence of 2-factors in iterated line graphs , 2007, Discuss. Math. Graph Theory.

[5] Mingchu Li,et al. The hamiltonian index of a graph and its branch-bonds , 2004, Discret. Math..

[6] Jun Fujisawa,et al. The upper bound of the number of cycles in a 2-factor of a line graph , 2007, J. Graph Theory.

[7] Ronald J. Gould,et al. A note on cycles in 2-factors of line graphs , 1999 .

[8] Jun Fujisawa,et al. The upper bound of the number of cycles in a 2-factor of a line graph , 2007 .

[9] Gary Chartrand. ON HAMILTONIAN LINE-GRAPHS(') , 1968 .

[10] F. Harary,et al. On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.

[11] Hong-Jian Lai. On the Hamiltonian index , 1988, Discret. Math..