论文信息 - A degree condition implying that every matching is contained in a hamiltonian cycle

A degree condition implying that every matching is contained in a hamiltonian cycle

We give a degree sum condition for three independent vertices under which every matching of a graph lies in a hamiltonian cycle. We also show that the bound for the degree sum is almost the best possible.

[1] O. Ore. Note on Hamilton Circuits , 1960 .

[2] John Adrian Bondy,et al. A method in graph theory , 1976, Discret. Math..

[3] Kenneth A. Berman,et al. Proof of a conjecture of Häggkvist on cycles and independent edges , 1983, Discret. Math..

[4] Α. P. Wojda. HAMILTONIAN CYCLES THROUGH MATCHINGS , 1988 .

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

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

[7] Nicholas C. Wormald,et al. Cycles containing matchings and pairwise compatible euler tours , 1990, J. Graph Theory.

[8] Zhenqi Yang,et al. On F-Hamiltonian graphs , 1999, Discret. Math..